This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
— We present a global vector field computation algorithm in configuration spaces for smooth feedback motion planning. Our algorithm performs approximate cell decomposition in t...
— Given a robot model and a class of admissible environments, this paper provides a framework for automatically and verifiably composing controllers that satisfy high level task...
Hadas Kress-Gazit, Georgios E. Fainekos, George J....
We study the complexity of the motion planning problem for a bounded-reach robot in the situation where the n obstacles in its workspace satisfy two of the realistic models propos...
Mark de Berg, Matthew J. Katz, Mark H. Overmars, A...
While exploring to nd better solutions, an agent performing online reinforcement learning (RL) can perform worse than is acceptable. In some cases, exploration might have unsafe, ...
Satinder P. Singh, Andrew G. Barto, Roderic A. Gru...