ACM Home Page
Please provide us with feedback. Feedback
Applications of a logic of knowledge to motion planning under uncertainty
Full text PdfPdf (269 KB)
Source Journal of the ACM (JACM) archive
Volume 44 ,  Issue 5  (September 1997) table of contents
Pages: 633 - 668  
Year of Publication: 1997
ISSN:0004-5411
Authors
Ronen I. Brafman  Ben-Gurion Univ., Beer Sheva, Israel
Jean-Claude Latombe  Stanford Univ., Stanford, CA
Yoram Moses  Weizmann Institute of Science, Rehovot, Israel
Yoav Shoham  Stanford Univ., Stanford, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 48,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/265910.265912
What is a DOI?

ABSTRACT

Inspired by the success of the distributed computing community in apply logics of knowledge and time to reasoning about distributed protocols, we aim for a similarly powerful and high-level abstraction when reasoning about control problems involving uncertainty. This paper concentrates on robot motion planning with uncertainty in both control and sensing, a problem that has already been well studied within the robotics community. First, a new and natural problem in this domain is defined: does there exists a sound and complete termination condition for a motion, given initial and goal locations? If yes, how to construct it? Then we define a high-level language, a logic of time and knowledge, which we use to reason about termination conditions and to state general conditions for the existence of sound and complete termination conditions in a broad domain. Finally, we show that sound termination conditions that are optimal in a precise sense provide a natural example of knowledge-based programs with multiple implementations.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
BRAFMAN, R. I., LATOMBE, J. C., AND SHOHAM, Y. 1993. Towards knowledge-level analysis of motion planning. In Proceedings of the llth National Conference on/II, pp. 670-675.
 
3
 
4
CANNY, J. f. 1989. On computability of fine motion plans. In Proceedings of the 1989 IEEE International Conference on Robotics and Automata. IEEE, New York, pp. 177-182.
 
5
 
6
 
7
 
8
 
9
 
10
ERDMANN, M. 1994. Understanding actions and sensing by designing action-based sensors. In IEEE ICEA Workshop on Design. IEEE, New York.
 
11
 
12
HALPERN, J. Y., AND FAGIN, R. 1989. Modelling knowledge and action in distributed systems. Dist. Comput. 3, 159-177.
13
14
 
15
HINTIKKA, J. 1962. Knowledge and Belief. Cornell University Press, Ithaca, N.Y.
 
16
KAELBLING, L. P., AND ROSENSCHEIN, S.J. 1990. Action and planning in embedded agents. Rob. Auto. Syst. 6, 35-48.
 
17
 
18
 
19
 
20
 
21
LOZANO-PI#REZ, f. 1983. Spatial planning: A configuration space approach. IEEE Trans. Comput. C-32, 2, 108-120.
 
22
LOZANO-PI#REZ, f., MASON, M. f., AND TAYLOR, R.n. 1984. Automatic synthesis of fine-motion strategies for robots. Int. J. Robotics Res. 3, 1, 3-24.
 
23
MASON, M. f. 1984. Automatic planning of fine motions: Correctness and completeness. In Proceedings of the IEEE International Conference on Robotics and Automata. IEEE, New York.
 
24
MOORE, R.C. 1985. A formal theory of knowledge and action. In Formal Theories of the Common Sense World.
 
25
MOSES, Y., AND TUTTLE, M.R. 1988. Programming simultaneous actions using common knowledge. Algorithmica. 3, 121-169.
 
26
 
27
TARSKI, A. 1955. A lattice-theoretic fixpoint theorem and its applications. Pac. J. Math. 5, 285-309.
 
28



REVIEW

"Giuseppina Carla Gini : Reviewer"

The research described here is aimed at applying formal logic to problems that are usually approached using systems and control theory or geometric reasoning. The problem addressed is whether a mobile robot will be able to reach its destinatio  more...

Collaborative Colleagues:
Ronen I. Brafman: colleagues
Jean-Claude Latombe: colleagues
Yoram Moses: colleagues
Yoav Shoham: colleagues