Navigation problem
 | This article or section is in a state of significant expansion or restructuring. You are welcome to assist in its construction by editing it as well. If this article or section has not been edited in several days, please remove this template. If you are the editor who added this template and you are actively editing, please be sure to replace this template with {{in use}} during the active editing session. Click on the link for template parameters to use.
This redirect was last edited by Samfreed (talk | contribs) 19 years ago. (Update timer) |
The Navigation Problem is one of the unsolved problems of computer science and robotics. The problem is in creating an algorithm that would be able to find its way around a room, or a maze - dealing with obstacles that may be in the way.
Here are some links that should be made into this article:
- http://nips.djvuzone.org/
- http://citeseer.ist.psu.edu/context/642919/0
- Many articles refered by http://citeseer.ifi.unizh.ch/context/52914/0
- http://citeseer.ifi.unizh.ch/impacttaskforce96application.html
- http://citeseer.ifi.unizh.ch/155925.html
- http://citeseer.ifi.unizh.ch/164761.html
- http://citeseer.ifi.unizh.ch/259432.html
- http://citeseer.ifi.unizh.ch/albers97exploring.html
- http://citeseer.ifi.unizh.ch/rao93robot.html
- http://citeseer.ifi.unizh.ch/475748.html
- http://www.ics.forth.gr/~foka/phd.html
- Navigation research
- A search to continue:
Theories on the origin of the problem
 | This computer science article is a stub. You can help Wikipedia by expanding it. |