scholarly journals Integrating a Path Planner and an Adaptive Motion Controller for Navigation in Dynamic Environments

2019 ◽  
Vol 9 (7) ◽  
pp. 1384 ◽  
Author(s):  
Junjie Zeng ◽  
Long Qin ◽  
Yue Hu ◽  
Quanjun Yin ◽  
Cong Hu

Since an individual approach can hardly navigate robots through complex environments, we present a novel two-level hierarchical framework called JPS-IA3C (Jump Point Search improved Asynchronous Advantage Actor-Critic) in this paper for robot navigation in dynamic environments through continuous controlling signals. Its global planner JPS+ (P) is a variant of JPS (Jump Point Search), which efficiently computes an abstract path of neighboring jump points. These nodes, which are seen as subgoals, completely rid Deep Reinforcement Learning (DRL)-based controllers of notorious local minima. To satisfy the kinetic constraints and be adaptive to changing environments, we propose an improved A3C (IA3C) algorithm to learn the control policies of the robots’ local motion. Moreover, the combination of modified curriculum learning and reward shaping helps IA3C build a novel reward function framework to avoid learning inefficiency because of sparse reward. We additionally strengthen the robots’ temporal reasoning of the environments by a memory-based network. These improvements make the IA3C controller converge faster and become more adaptive to incomplete, noisy information caused by partial observability. Simulated experiments show that compared with existing methods, this JPS-IA3C hierarchy successfully outputs continuous commands to accomplish large-range navigation tasks at shorter paths and less time through reasonable subgoal selection and rational motions.

Sensors ◽  
2019 ◽  
Vol 19 (18) ◽  
pp. 3837 ◽  
Author(s):  
Junjie Zeng ◽  
Rusheng Ju ◽  
Long Qin ◽  
Yue Hu ◽  
Quanjun Yin ◽  
...  

In this paper, we propose a novel Deep Reinforcement Learning (DRL) algorithm which can navigate non-holonomic robots with continuous control in an unknown dynamic environment with moving obstacles. We call the approach MK-A3C (Memory and Knowledge-based Asynchronous Advantage Actor-Critic) for short. As its first component, MK-A3C builds a GRU-based memory neural network to enhance the robot’s capability for temporal reasoning. Robots without it tend to suffer from a lack of rationality in face of incomplete and noisy estimations for complex environments. Additionally, robots with certain memory ability endowed by MK-A3C can avoid local minima traps by estimating the environmental model. Secondly, MK-A3C combines the domain knowledge-based reward function and the transfer learning-based training task architecture, which can solve the non-convergence policies problems caused by sparse reward. These improvements of MK-A3C can efficiently navigate robots in unknown dynamic environments, and satisfy kinetic constraints while handling moving objects. Simulation experiments show that compared with existing methods, MK-A3C can realize successful robotic navigation in unknown and challenging environments by outputting continuous acceleration commands.


Author(s):  
Rosa Delima ◽  
Gregorius Titis Indrajaya ◽  
Abednego Kristiawan Takaredase ◽  
Ignatia Dhian E.K.R. ◽  
Antonius Rachmat C
Keyword(s):  

2021 ◽  
Vol 18 (4) ◽  
pp. 172988142110192
Author(s):  
Ben Zhang ◽  
Denglin Zhu

Innovative applications in rapidly evolving domains such as robotic navigation and autonomous (driverless) vehicles rely on motion planning systems that meet the shortest path and obstacle avoidance requirements. This article proposes a novel path planning algorithm based on jump point search and Bezier curves. The proposed algorithm consists of two main steps. In the front end, the improved heuristic function based on distance and direction is used to reduce the cost, and the redundant turning points are trimmed. In the back end, a novel trajectory generation method based on Bezier curves and a straight line is proposed. Our experimental results indicate that the proposed algorithm provides a complete motion planning solution from the front end to the back end, which can realize an optimal trajectory from the initial point to the target point used for robot navigation.


2014 ◽  
Vol Volume 2 ◽  
Author(s):  
Hasmik Atoyan ◽  
Jean-Marc Robert ◽  
Jean-Rémi Duquet

The utilization of Decision Support Systems (DSS) in complex dynamic environments leads the human operator almost inevitably to having to face several types of uncertainties. Thus it is essential for system designers to clearly understand the different types of uncertainties that could exist in human-machine systems of complex environments, to know their impacts on the operator's trust in the systems and decision-making process, and to have guidelines on how to present uncertain information on user interfaces. It is also essential for them to have an overview of the different stages, levels, and types of system automation, and to know their possible impacts on the creation of different types of uncertainties. This paper investigates these topics and aim at helping researchers and practitioners to deal with uncertainties in complex environments.


Author(s):  
Daniel D. Harabor ◽  
Tansel Uras ◽  
Peter J. Stuckey ◽  
Sven Koenig

In this paper, we define Jump Point Graphs (JP), a preprocessing-based path-planning technique similar to Subgoal Graphs (SG). JP allows for the first time the combination of Jump Point Search style pruning in the context of abstraction-based speedup techniques, such as Contraction Hierarchies. We compare JP with SG and its variants and report new state-of-the-art results for grid-based pathfinding.


10.5772/45669 ◽  
2012 ◽  
Vol 9 (1) ◽  
pp. 19 ◽  
Author(s):  
Chien-Chou Lin ◽  
Kun-Cheng Chen ◽  
Wei-Ju Chuang

A hierarchical memetic algorithm (MA) is proposed for the path planning and formation control of swarm robots. The proposed algorithm consists of a global path planner (GPP) and a local motion planner (LMP). The GPP plans a trajectory within the Voronoi diagram (VD) of the free space. An MA with a non-random initial population plans a series of configurations along the path given by the former stage. The MA locally adjusts the robot positions to search for better fitness along the gradient direction of the distance between the swarm robots and the intermediate goals (IGs). Once the optimal configuration is obtained, the best chromosomes are reserved as the initial population for the next generation. Since the proposed MA has a non-random initial population and local searching, it is more efficient and the planned path is faster compared to a traditional genetic algorithm (GA). The simulation results show that the proposed algorithm works well in terms of path smoothness and computation efficiency.


2011 ◽  
Vol 66 (4) ◽  
pp. 477-494 ◽  
Author(s):  
Andrew J. Berry ◽  
Jeremy Howitt ◽  
Da-Wei Gu ◽  
Ian Postlethwaite

Sign in / Sign up

Export Citation Format

Share Document