Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
12,405
result(s) for
"path planning"
Sort by:
Multi-robot path planning based on a deep reinforcement learning DQN algorithm
The unmanned warehouse dispatching system of the ‘goods to people’ model uses a structure mainly based on a handling robot, which saves considerable manpower and improves the efficiency of the warehouse picking operation. However, the optimal performance of the scheduling system algorithm has high requirements. This study uses a deep Q-network (DQN) algorithm in a deep reinforcement learning algorithm, which combines the Q-learning algorithm, an empirical playback mechanism, and the volume-based technology of productive neural networks to generate target Q-values to solve the problem of multi-robot path planning. The aim of the Q-learning algorithm in deep reinforcement learning is to address two shortcomings of the robot path-planning problem: slow convergence and excessive randomness. Preceding the start of the algorithmic process, prior knowledge and prior rules are used to improve the DQN algorithm. Simulation results show that the improved DQN algorithm converges faster than the classic deep reinforcement learning algorithm and can more quickly learn the solutions to path-planning problems. This improves the efficiency of multi-robot path planning.
Journal Article
Path Planning Trends for Autonomous Mobile Robot Navigation: A Review
With the development of robotics technology, there is a growing demand for robots to perform path planning autonomously. Therefore, rapidly and safely planning travel routes has become an important research direction for autonomous mobile robots. This paper elaborates on traditional path-planning algorithms and the limitations of these algorithms in practical applications. Meanwhile, in response to these limitations, it reviews the current research status of recent improvements to these traditional algorithms. The results indicate that these improved path-planning algorithms perform well in tests or practical applications, and multi-algorithm fusion for path planning outperforms single-algorithm path planning.
Journal Article
Red-billed blue magpie optimizer: a novel metaheuristic algorithm for 2D/3D UAV path planning and engineering design problems
Numerical optimization, Unmanned Aerial Vehicle (UAV) path planning, and engineering design problems are fundamental to the development of artificial intelligence. Traditional methods show limitations in dealing with these complex nonlinear models. To address these challenges, the swarm intelligence algorithm is introduced as a metaheuristic method and effectively implemented. However, existing technology exhibits drawbacks such as slow convergence speed, low precision, and poor robustness. In this paper, we propose a novel metaheuristic approach called the Red-billed Blue Magpie Optimizer (RBMO), inspired by the cooperative and efficient predation behaviors of red-billed blue magpies. The mathematical model of RBMO was established by simulating the searching, chasing, attacking prey, and food storage behaviors of the red-billed blue magpie. To demonstrate RBMO’s performance, we first conduct qualitative analyses through convergence behavior experiments. Next, RBMO’s numerical optimization capabilities are substantiated using CEC2014 (Dim = 10, 30, 50, and 100) and CEC2017 (Dim = 10, 30, 50, and 100) suites, consistently achieving the best Friedman mean rank. In UAV path planning applications (two-dimensional and three − dimensional), RBMO obtains preferable solutions, demonstrating its effectiveness in solving NP-hard problems. Additionally, in five engineering design problems, RBMO consistently yields the minimum cost, showcasing its advantage in practical problem-solving. We compare our experimental results with three categories of widely recognized algorithms: (1) advanced variants, (2) recently proposed algorithms, and (3) high-performance optimizers, including CEC winners.
Journal Article
Hybrid Path Planning Based on Safe A Algorithm and Adaptive Window Approach for Mobile Robot in Large-Scale Dynamic Environment
When mobile robot used in large-scale dynamic environments, it face more challenging problems in real-time path planning and collision-free path tracking. This paper presents a new hybrid path planning method that combines A* algorithm with adaptive window approach to conduct global path planning, real-time tracking and obstacles avoidance for mobile robot in large-scale dynamic environments. Firstly, a safe A* algorithm is designed to simplify the calculation of risk cost function and distance cost. Secondly, key path points are extracted from the planned path which generated by the safe A* to reduce the number of the grid nodes for smooth path tracking. Finally, the real-time motion planning based on adaptive window approach is adopted to achieve the simultaneous path tracking and obstacle avoidance (SPTaOA) together the switching of the key path points. The simulation and practical experiments are conducted to verify the feasibility and performance of the proposed method. The results show that the proposed hybrid path planning method, used for global path planning, tracking and obstacles avoidance, can meet the application needs of mobile robots in complex dynamic environments.
Journal Article
Obstacle Avoidance and Path Planning Methods for Autonomous Navigation of Mobile Robot
Path planning creates the shortest path from the source to the destination based on sensory information obtained from the environment. Within path planning, obstacle avoidance is a crucial task in robotics, as the autonomous operation of robots needs to reach their destination without collisions. Obstacle avoidance algorithms play a key role in robotics and autonomous vehicles. These algorithms enable robots to navigate their environment efficiently, minimizing the risk of collisions and safely avoiding obstacles. This article provides an overview of key obstacle avoidance algorithms, including classic techniques such as the Bug algorithm and Dijkstra’s algorithm, and newer developments like genetic algorithms and approaches based on neural networks. It analyzes in detail the advantages, limitations, and application areas of these algorithms and highlights current research directions in obstacle avoidance robotics. This article aims to provide comprehensive insight into the current state and prospects of obstacle avoidance algorithms in robotics applications. It also mentions the use of predictive methods and deep learning strategies.
Journal Article
Multi UAV Coverage Path Planning in Urban Environments
Coverage path planning (CPP) is a field of study which objective is to find a path that covers every point of a certain area of interest. Recently, the use of Unmanned Aerial Vehicles (UAVs) has become more proficient in various applications such as surveillance, terrain coverage, mapping, natural disaster tracking, transport, and others. The aim of this paper is to design efficient coverage path planning collision-avoidance capable algorithms for single or multi UAV systems in cluttered urban environments. Two algorithms are developed and explored: one of them plans paths to cover a target zone delimited by a given perimeter with predefined coverage height and bandwidth, using a boustrophedon flight pattern, while the other proposed algorithm follows a set of predefined viewpoints, calculating a smooth path that ensures that the UAVs pass over the objectives. Both algorithms have been developed for a scalable number of UAVs, which fly in a triangular deformable leader-follower formation with the leader at its front. In the case of an even number of UAVs, there is no leader at the front of the formation and a virtual leader is used to plan the paths of the followers. The presented algorithms also have collision avoidance capabilities, powered by the Fast Marching Square algorithm. These algorithms are tested in various simulated urban and cluttered environments, and they prove capable of providing safe and smooth paths for the UAV formation in urban environments.
Journal Article
An Improved Global and Local Fusion Path-Planning Algorithm for Mobile Robots
Path planning is a core technology for mobile robots. However, existing state-of-the-art methods suffer from issues such as excessive path redundancy, too many turning points, and poor environmental adaptability. To address these challenges, this paper proposes a novel global and local fusion path-planning algorithm. For global path planning, we reduce path redundancy and excessive turning points by designing a new heuristic function and constructing an improved path generation method. For local path planning, we propose an environment-aware dynamic parameter adjustment strategy, incorporating deviation and avoidance dynamic obstacle evaluation factors, thus addressing issues of local optima and timely avoidance of dynamic obstacles. Finally, we fuse those global and local path-planning improvements to form our fusion path-planning algorithm, which can enhance the robot’s adaptability to complex scenarios while reducing path redundancy and turning points. Simulation experiments demonstrate that the improved fusion path-planning algorithm not only effectively addresses existing issues but also operates with higher efficiency.
Journal Article
Path Planning for Autonomous Drones: Challenges and Future Directions
Unmanned aerial vehicles (UAV), or drones, have gained a lot of popularity over the last decade. The use of autonomous drones appears to be a viable and low-cost solution to problems in many applications. Path planning capabilities are essential for autonomous control systems. An autonomous drone must be able to rapidly compute feasible and energy-efficient paths to avoid collisions. In this study, we review two key aspects of path planning: environmental representation and path generation techniques. Common path planning techniques are analyzed, and their key limitations are highlighted. Finally, we review thirty-five highly cited publications to identify current trends in drone path planning research. We then use these results to identify factors that need to be addressed in future studies in order to develop a practical path planner for autonomous drones.
Journal Article
Bio-Inspired Optimization-Based Path Planning Algorithms in Unmanned Aerial Vehicles: A Survey
Advancements in electronics and software have enabled the rapid development of unmanned aerial vehicles (UAVs) and UAV-assisted applications. Although the mobility of UAVs allows for flexible deployment of networks, it introduces challenges regarding throughput, delay, cost, and energy. Therefore, path planning is an important aspect of UAV communications. Bio-inspired algorithms rely on the inspiration and principles of the biological evolution of nature to achieve robust survival techniques. However, the issues have many nonlinear constraints, which pose a number of problems such as time restrictions and high dimensionality. Recent trends tend to employ bio-inspired optimization algorithms, which are a potential method for handling difficult optimization problems, to address the issues associated with standard optimization algorithms. Focusing on these points, we investigate various bio-inspired algorithms for UAV path planning over the past decade. To the best of our knowledge, no survey on existing bio-inspired algorithms for UAV path planning has been reported in the literature. In this study, we investigate the prevailing bio-inspired algorithms extensively from the perspective of key features, working principles, advantages, and limitations. Subsequently, path planning algorithms are compared with each other in terms of their major features, characteristics, and performance factors. Furthermore, the challenges and future research trends in UAV path planning are summarized and discussed.
Journal Article