On Receding Horizon Chance Constraint Motion Planning for Uncertain Multi-Agent Systems

2019 ◽  
Author(s):  
Yash Bagla ◽  
Vaibhav Srivastava
Keyword(s):  
Motion Planning ◽  
Autonomous Systems ◽  
Random Trees ◽  
Chance Constraint ◽  
Multi Agent Systems ◽  
Receding Horizon ◽  
Uncertain Environments ◽  
Uncertainty Model ◽  
Planning Algorithm ◽  
Multi Agent

Abstract We propose and study a motion planning algorithm for multi-agent autonomous systems to navigate through uncertain and dynamic environments. We use a receding horizon chance constraint framework that allows for tuning the trade-off between the risk of collision and the infeasibility of paths. We consider sampling-based incremental planning algorithms and extend them to the case of multiple agents and dynamic and uncertain environments. The receding horizon control framework is used to incorporate sensor measurements at a fixed interval of time to reduce uncertainty about agents’ state and environment. Our presentation focuses on rapidly-exploring random trees (RRTs) and the assumption of Gaussian noise in the uncertainty model. Our algorithm is illustrated using several examples.

A Geometric Approach to Dynamically Feasible, Real-Time Formation Control

2011 ◽  
Vol 133 (2) ◽  
Author(s):  
D. H. A. Maithripala ◽  
D. H. S. Maithripala ◽  
S. Jayasuriya
Keyword(s):  
Real Time ◽  
Wide Class ◽  
Formation Control ◽  
Geometric Approach ◽  
Control Problems ◽  
Multi Agent Systems ◽  
Individual Agent ◽  
Planning Algorithm ◽  
Explicit Consideration ◽  
Multi Agent

We propose a framework for synthesizing real-time trajectories for a wide class of coordinating multi-agent systems. The class of problems considered is characterized by the ability to decompose a given formation objective into an equivalent set of lower dimensional problems. These include the so called radar deception problem and the formation control problems that fall under formation keeping and/or formation reconfiguration tasks. The decomposition makes the approach scalable, computationally economical, and decentralized. Most importantly, the designed trajectories are dynamically feasible, meaning that they maintain the formation while satisfying the nonholonomic and saturation type velocity and acceleration constraints of each individual agent. The main contributions of this paper are (i) explicit consideration of second order dynamics for agents, (ii) explicit consideration of nonholonomic and saturation type velocity and acceleration constraints, (iii) unification of a wide class of formation control problems, and (iv) development of a real-time, distributed, scalable, computationally economical motion planning algorithm.

scholarly journals Sampling-Based Motion Planning for Free-Floating Space Robot without Inverse Kinematics

2020 ◽  
Vol 10 (24) ◽  
pp. 9137
Author(s):  
Hongwen Zhang ◽  
Zhanxia Zhu
Keyword(s):  
Motion Planning ◽  
Inverse Kinematics ◽  
Random Trees ◽  
Space Robot ◽  
Initial Configuration ◽  
First Order ◽  
System A ◽  
Planning Framework ◽  
Planning Algorithm ◽  
Differential Relationship

Motion planning is one of the most important technologies for free-floating space robots (FFSRs) to increase operation safety and autonomy in orbit. As a nonholonomic system, a first-order differential relationship exists between the joint angle and the base attitude of the space robot, which makes it pretty challenging to implement the relevant motion planning. Meanwhile, the existing planning framework must solve inverse kinematics for goal configuration and has the limitation that the goal configuration and the initial configuration may not be in the same connected domain. Thus, faced with these questions, this paper investigates a novel motion planning algorithm based on rapidly-exploring random trees (RRTs) for an FFSR from an initial configuration to a goal end-effector (EE) pose. In a motion planning algorithm designed to deal with differential constraints and restrict base attitude disturbance, two control-based local planners are proposed, respectively, for random configuration guiding growth and goal EE pose-guiding growth of the tree. The former can ensure the effective exploration of the configuration space, and the latter can reduce the possibility of occurrence of singularity while ensuring the fast convergence of the algorithm and no violation of the attitude constraints. Compared with the existing works, it does not require the inverse kinematics to be solved while the planning task is completed and the attitude constraint is preserved. The simulation results verify the effectiveness of the algorithm.

A Two-Layer Approach to Developing Self-Adaptive Multi-Agent Systems in Open Environment

2014 ◽  
Vol 6 (1) ◽  
pp. 65-85 ◽  
Author(s):  
Xinjun Mao ◽  
Menggao Dong ◽  
Haibin Zhu
Keyword(s):  
Reinforcement Learning ◽  
Adaptive Systems ◽  
Multi Agent Systems ◽  
Uncertain Environments ◽  
Implementation Framework ◽  
Fine Grain ◽  
Adaptation Mechanisms ◽  
Multi Agent ◽  
Self Adaptation ◽  
Self Adaptive

Development of self-adaptive systems situated in open and uncertain environments is a great challenge in the community of software engineering due to the unpredictability of environment changes and the variety of self-adaptation manners. Explicit specification of expected changes and various self-adaptations at design-time, an approach often adopted by developers, seems ineffective. This paper presents an agent-based approach that combines two-layer self-adaptation mechanisms and reinforcement learning together to support the development and running of self-adaptive systems. The approach takes self-adaptive systems as multi-agent organizations and enables the agent itself to make decisions on self-adaptation by learning at run-time and at different levels. The proposed self-adaptation mechanisms that are based on organization metaphors enable self-adaptation at two layers: fine-grain behavior level and coarse-grain organization level. Corresponding reinforcement learning algorithms on self-adaptation are designed and integrated with the two-layer self-adaptation mechanisms. This paper further details developmental technologies, based on the above approach, in establishing self-adaptive systems, including extended software architecture for self-adaptation, an implementation framework, and a development process. A case study and experiment evaluations are conducted to illustrate the effectiveness of the proposed approach.

Feedback motion planning of unmanned surface vehicles via random sequential composition

2019 ◽  
Vol 41 (12) ◽  
pp. 3321-3330 ◽  
Author(s):  
Emre Ege ◽  
Mustafa Mert Ankarali
Keyword(s):  
Motion Planning ◽  
Broad Class ◽  
Random Trees ◽  
Main Approach ◽  
Unmanned Surface Vehicles ◽  
Sequential Composition ◽  
Planning Algorithm ◽  
Overall Performance ◽  
Simulation Results ◽  
Feasible Solutions

In this paper, we propose a new motion planning method that aims to robustly and computationally efficiently solve path planning and navigation problems for unmanned surface vehicles (USVs). Our approach is based on synthesizing two different existing methodologies: sequential composition of dynamic behaviours and rapidly exploring random trees (RRT). The main motivation of this integrated solution is to develop a robust feedback-based and yet computationally feasible motion planning algorithm for USVs. In order to illustrate the main approach and show the feasibility of the method, we performed simulations and tested the overall performance and applicability for future experimental applications. We also tested the robustness of the method under relatively extreme environmental uncertainty. Simulation results indicate that our method can produce robust and computationally feasible solutions for a broad class of USVs.

Sign in / Sign up

Export Citation Format

Share Document