Variational collision and obstacle avoidance of multi-agent systems on Riemannian manifolds
In this paper we study a path planning problem from a variational approach to collision and obstacle avoidance for multi-agent systems evolving on a Riemannian manifold. The problem consists of finding non-intersecting trajectories between the agent and prescribed obstacles on the workspace, among a set of admissible curves, to reach a specified configuration, based on minimizing an energy functional that depends on the velocity, covariant acceleration and an artificial potential function used to prevent collision with the obstacles and among the agents. We apply the results to examples of a planar rigid body, and collision and obstacle avoidance for agents evolving on a sphere.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Improved Obstacle Avoidance for Autonomous Robots with ORCA-FLC
Obstacle avoidance enables autonomous agents and robots to operate safely and efficiently in dynamic and complex environments, reducing the risk of collisions and damage. For a robot or autonomous system to successfully …
Reinforcement LearningCollision AvoidanceDistributed Adaptive Consensus with Obstacle and Collision Avoidance for Networks of Heterogeneous Multi-Agent Systems
This paper presents a distributed adaptive control strategy for multi-agent systems with heterogeneous dynamics and collision avoidance. We propose an adaptive control strategy designed to ensure leader-following formati…
Collision AvoidanceVariational Autoencoders for exteroceptive perception in reinforcement learning-based collision avoidance
Modern control systems are increasingly turning to machine learning algorithms to augment their performance and adaptability. Within this context, Deep Reinforcement Learning (DRL) has emerged as a promising control fram…
Collision AvoidanceDeep Reinforcement Learningreinforcement-learningDeep-Learned Collision Avoidance Policy for Distributed Multi-Agent Navigation
High-speed, low-latency obstacle avoidance that is insensitive to sensor noise is essential for enabling multiple decentralized robots to function reliably in cluttered and dynamic environments. While other distributed m…
Collision AvoidanceDistributed Coverage Control of Multi-Agent Networks with Guaranteed Collision Avoidance in Cluttered Environments
We propose a distributed control algorithm for a multi-agent network whose agents deploy over a cluttered region in accordance with a time-varying coverage density function while avoiding collisions with all obstacles th…
Collision Avoidance