Autonomous inspection tasks necessitate effective path-planning mechanis...
We consider a Multi-Agent Path Finding (MAPF) setting where agents have ...
In automated warehouses, teams of mobile robots fulfill the packaging pr...
Offline reinforcement-learning (RL) algorithms learn to make decisions u...
We consider the problem of finding collision-free paths for
curvature-co...
Multi-agent pathfinding (MAPF) is concerned with planning collision-free...
A central challenge in building robotic prostheses is the creation of a
...
In Lifelong Multi-Agent Path Finding (L-MAPF) a team of agents performs ...
Medical steerable needles can follow 3D curvilinear trajectories inside ...
Medical steerable needles can move along 3D curvilinear trajectories to ...
We introduce the Cooperative Multi-Agent Path Finding (Co-MAPF) problem,...
The problem of Multi-Agent Path Finding (MAPF) calls for finding a set o...
The inspection-planning problem calls for computing motions for a robot ...
In warehouse and manufacturing environments, manipulation platforms are
...
Steerable needles are capable of accurately targeting difficult-to-reach...
We consider the bi-criteria shortest-path problem where we want to compu...
In warehousing and manufacturing environments, manipulation platforms ar...
Simulators are an important tool in robotics that is used to develop rob...
We consider the task of autonomously unloading boxes from trucks using a...
Planning for multi-robot coverage seeks to determine collision-free path...
Inspection planning, the task of planning motions that allow a robot to
...
Lazy search algorithms can efficiently solve problems where edge evaluat...
In manufacturing and automation settings, robots often have to perform
h...
Motion-planning problems, such as manipulation in cluttered environments...
Planning the motion for humanoid robots is a computationally-complex tas...
We propose an algorithmic framework for efficient anytime motion plannin...
We present an algorithm that generates a collision-free configuration-sp...
Asymptotically-optimal motion planners such as RRT* have been shown to
i...
The Lazy Shortest Path (LazySP) class consists of motion-planning algori...
We consider the problem of planning a collision-free path for a
high-dim...
We study a path-planning problem amid a set O of obstacles in
R^2, in wh...