Download
This project provides a resolution algorithm for the optimal exploration problem in the discrete space. Specifically, we define the optimal exploration problem as a classical AI search problem, which is solved with A*. A set of parameters and speedup techniques are proposed in order to balance the algorithm's expected computation time and the solution's quality.
For more details, refer to the preliminary paper: A. Quattrini Li, F. Amigoni, and N. Basilico. Searching for optimal off-line exploration paths in grid environments for a robot with limited visibility. In Proc. AAAI, pages 2060–2066, 2012.
Also, an extended version of the paper published at AAAI has been submitted to a journal.
Project Samples
Follow Optimal exploration path
Other Useful Business Software
Paessler: Easy to Use With Enterprise Power. Free Trial
You shouldn't have to choose between a monitoring tool that's easy to use and one that's powerful enough for a complex environment. PRTG's low-code interface lets any admin build dashboards, set alerts and monitor devices without scripting, while custom sensors and full API access are there when your team needs deeper control. One platform, no compromise. Download a free 30-day trial now.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Optimal exploration path!
