—To efficiently solve challenging motion-planning problems with dynamics, this paper proposes treating motion planning not just as a search problem in a continuous space but as ...
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
Traditional artificial intelligence techniques do not perform well in applications such as real-time strategy games because of the extensive search spaces which need to be explore...
— The need for reliable maps of subterranean spaces too hazardous for humans to occupy has motivated the use of robotic technology as mapping tools. As such, we present a systemi...
Aaron Morris, David Silver, David I. Ferguson, Sco...
With the total energy consumption of computing systems increasing in a steep rate, much attention has been paid to the design of energy-efficient computing systems and applications...