Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
A near-tight approximation lower bound and algorithm for the kidnapped robot problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Strong planning under partial observability
Artificial Intelligence
Planning in nondeterministic domains under partial observability via symbolic model checking
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Strong planning under partial observability
Artificial Intelligence
Localization: approximation and performance bounds to minimize travel distance
IEEE Transactions on Robotics
Hi-index | 0.00 |