Mobile robot path planning involves designing optimal routes from starting points to
destinations within specific environmental conditions. Even though there are well …

Multi-robot motion planning (MRMP) is the fundamental problem of finding non-colliding
trajectories for multiple robots acting in an environment, under kinodynamic constraints. Due …

Este artículo presenta una revisión bibliográfica de los algoritmos de aprendizaje
automático utilizados para dar solución a la problemática de los MARS para la PCP …

Portfolio-based algorithm selection can help in choosing the best suited algorithm for a
given task while leveraging the complementary strengths of the candidates. Solving the Multi …

This paper investigates the problem of fixed-wing unmanned aerial vehicles (UAV s) motion
planning with posture constraints and the problem of the more general symmetrical …

Multi-vehicle coordinated motion planning has always been challenged to safely and
efficiently resolve conflicts under non-holonomic dynamic constraints. Constructing spatial …

Multi-Agent Path Finding (MAPF) in crowded environments presents a challenging problem
in motion planning, aiming to find collision-free paths for all agents in the system. MAPF …

We focus on the problem of rearranging a set of objects with a team of car-like robot pushers
built using off-the-shelf components. Maintaining control of pushed objects while avoiding …

Due to its flexibility and complementarity, the multi-UAVs system is well adapted to complex
and cramped workspaces, with great application potential in the search and rescue (SAR) …

Heterogeneous autonomous vehicle (HAV) coordinated motion planning must guide each
vehicle out of the conflict zone based on the differences in vehicle platform characteristics …