mlsanityData to 7 Oct 2026

Long Short-Term Memory for Spatial Encoding in Multi-Agent Path Planning

arXiv 2203.10823 ↗First posted 21 Mar 2022cs.RO cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Reinforcement learning-based path planning for multi-agent systems of varying size constitutes a research topic with increasing significance as progress in domains such as urban air mobility and autonomous aerial vehicles continues. Reinforcement learning with continuous state and action spaces is used to train a policy network that accommodates desirable path planning behaviors and can be used for time-critical applications. A Long Short-Term Memory module is proposed to encode an unspecified number of states for a varying, indefinite number of agents. The described training strategies and policy architecture lead to a guidance that scales to an infinite number of agents and unlimited physical dimensions, although training takes place at a smaller scale. The guidance is implemented on a low-cost, off-the-shelf onboard computer. The feasibility of the proposed approach is validated by presenting flight test results of up to four drones, autonomously navigating collision-free in a real-world environment.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 40 references that are in the map. First posted on arXiv 21 Mar 2022.

Builds on

7 of 40 references.

References · 7

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2017Proximal Policy Optimization Algorithmscited by 14,441
  3. 2015Trust Region Policy Optimizationcited by 2,503
  4. 2018Deep Neural Network Compression for Aircraft Collision Avoidance Systemscited by 58
  5. 2018Distributed Wildfire Surveillance with Autonomous Aircraft using Deep Reinforcement Learningcited by 16
  6. 2019Learning an Urban Air Mobility Encounter Model from Expert Preferencescited by 12
  7. 2013On Replacing PID Controller with ANN Controller for DC Motor Position Controlcited by 2

Built on by

Not cited yet.