264 research outputs found
Applying MAPP Algorithm for Cooperative Path Finding in Urban Environments
The paper considers the problem of planning a set of non-conflict
trajectories for the coalition of intelligent agents (mobile robots). Two
divergent approaches, e.g. centralized and decentralized, are surveyed and
analyzed. Decentralized planner - MAPP is described and applied to the task of
finding trajectories for dozens UAVs performing nap-of-the-earth flight in
urban environments. Results of the experimental studies provide an opportunity
to claim that MAPP is a highly efficient planner for solving considered types
of tasks
Symmetry-Based Search Space Reduction For Grid Maps
In this paper we explore a symmetry-based search space reduction technique
which can speed up optimal pathfinding on undirected uniform-cost grid maps by
up to 38 times. Our technique decomposes grid maps into a set of empty
rectangles, removing from each rectangle all interior nodes and possibly some
from along the perimeter. We then add a series of macro-edges between selected
pairs of remaining perimeter nodes to facilitate provably optimal traversal
through each rectangle. We also develop a novel online pruning technique to
further speed up search. Our algorithm is fast, memory efficient and retains
the same optimality and completeness guarantees as searching on an unmodified
grid map
- …