On the Complexity of Collecting Items With a Maximal Sliding Agent
We study the computational complexity of collecting items inside a grid map with obstacles, using an agent that always slides to the maximal extend, until it is stopped by an obstacle. An agent could be, for example, a robot or a vehicle, while obstacles could be walls or other immovable objects, an...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
DigitalCommons@USU
2014
|
| Subjects: | |
| Online Access: | https://digitalcommons.usu.edu/etd/3701 https://digitalcommons.usu.edu/cgi/viewcontent.cgi?article=4706&context=etd |