[PDF][PDF] Research challenges and opportunities in multi-agent path finding and multi-agent pickup and delivery problems

O Salzman, R Stern - Proceedings of the 19th International Conference …, 2020 - ifaamas.org
Recent years have shown a large increase in applications and research of problems that
include moving a fleet of physical robots. One particular application that is currently a multi …

[HTML][HTML] Toward asymptotically-optimal inspection planning via efficient near-optimal graph search

M Fu, A Kuntz, O Salzman… - Robotics science and …, 2019 - ncbi.nlm.nih.gov
Inspection planning, the task of planning motions that allow a robot to inspect a set of points
of interest, has applications in domains such as industrial, field, and medical robotics …

POMHDP: Search-based belief space planning using multiple heuristics

SK Kim, O Salzman, M Likhachev - Proceedings of the International …, 2019 - ojs.aaai.org
Robots operating in the real world encounter substantial uncertainty that cannot be modeled
deterministically before the actual execution. This gives rise to the necessity of robust motion …

Asymptotically optimal inspection planning via efficient near-optimal search on sampled roadmaps

M Fu, A Kuntz, O Salzman… - … International Journal of …, 2023 - journals.sagepub.com
Inspection planning, the task of planning motions for a robot that enable it to inspect a set of
points of interest, has applications in domains such as industrial, field, and medical robotics …

Online, interactive user guidance for high-dimensional, constrained motion planning

F Islam, O Salzman, M Likhachev - arXiv preprint arXiv:1710.03873, 2017 - arxiv.org
We consider the problem of planning a collision-free path for a high-dimensional robot.
Specifically, we suggest a planning framework where a motion-planning algorithm can …

Escaping local minima in search-based planning using soft duplicate detection

W Du, SK Kim, O Salzman… - 2019 IEEE/RSJ …, 2019 - ieeexplore.ieee.org
Search-based planning for relatively low-dimensional motion-planning problems such as for
autonomous navigation and autonomous flight has been shown to be very successful. Such …

Effective footstep planning using homotopy-class guidance

V Ranganeni, S Chintalapudi, O Salzman… - Artificial Intelligence, 2020 - Elsevier
Planning the motion for humanoid robots is a computationally-complex task due to the high
dimensionality of the system. Thus, a common approach is to first plan in the low …

Search-based path planning for a high dimensional manipulator in cluttered environments using optimization-based primitives

MS Saleem, R Sood, S Onodera… - 2021 IEEE/RSJ …, 2021 - ieeexplore.ieee.org
In this work we tackle the path planning problem for a 21-dimensional snake robot-like
manipulator, navigating a cluttered gas turbine for the purposes of inspection. Heuristic …

An efficient tangent based topologically distinctive path finding for grid maps

Z Yao, W Wang - arXiv preprint arXiv:2311.00853, 2023 - arxiv.org
Conventional local planners frequently become trapped in a locally optimal trajectory,
primarily due to their inability to traverse obstacles. Having a larger number of topologically …

Homology-Class Guided Rapidly-Exploring Random Tree For Belief Space Planning

R Hao, MC Çavusoğlu - 2022 IEEE/RSJ International …, 2022 - ieeexplore.ieee.org
In this work, an efficient homology guided belief space planning method for obstacle-
cluttered environments is presented. The proposed planner follows a two-step approach …