: We discuss the applications of modular self-reconfigurable robots to navigation. We show that greedy algorithms are complete for motion planning over a class of modular reconfigu...
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
Hamid Reza Chitsaz, Steven M. LaValle, Jason M. O'...
Many virtual environments and games must be populated with synthetic characters to create the desired experience. These characters must move with sufficient realism, so as not to...
Michael Gleicher, Hyun Joon Shin, Lucas Kovar, And...
The decades of research in motion planning have resulted in numerous algorithms. Many of the most successful algorithms are randomized and can have widely differing run-times for ...
— In this paper we present a novel framework for computing the steady turning motion of a robotic fish undergoing periodic body and/or tail deformation. Taking the turning radiu...
Qingsong Hu, Dawn R. Hedgepeth, Lihong Xu, Xiaobo ...