Using Many-Sorted Logic in the Object-Oriented Data Model for Fast Robot Task Planning

Journal of Intelligent and Robotic Systems: Theory and Applications

Volumn 23, Issue 1, 1998, Pages 1-25

  Chien, Y P ^a   Hudli, Anand ^a   Palakal, Mathew ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

Many sorted logic; Object oriented data model; Robot task planning

Indexed keywords

COMPUTATIONAL COMPLEXITY; MANY VALUED LOGICS; MATHEMATICAL MODELS; OBJECT ORIENTED PROGRAMMING; ROBOTS;

TASK PLANNING;

MOTION PLANNING;

EID: 0032162463     PISSN: 09210296     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008021418835     Document Type: Article

References (18)

1. Bancilhon, F. and Khoshafian, S.: A calculus for complex objects, ACM PODS Conf., 1986, pp. 53-59.
2. Carddelli, L.: A semantics of multiple inheritance, in: L. Cardelli (ed.), Semantics of Data Types, Lecture Notes in Comput. Sci., Vol. 173, Springer, 1984, pp. 51-67.
3. Chapman, D.: Planning for conjunctive goals, Artificial Intelligence 32 (1987), 333-377.
4. Collins, G., Birnbaum, L., Krulwich, B., and Freed, M.: The role of self-models in learning to plan, in: A. Meyrowitz and S. Chipman (eds), Foundations of Knowledge Acquisition, Machine Learning, Kluwer Academic Publishers, 1993, pp. 117-143.
5. Cohn, A. G.: Many-sorted logic = unsorted logic + control? in: M. Branur (ed.), Expert Systems 86, Cambridge Univ. Press, 1986, pp. 184-194.
6. DeJong, G., Gervasio, M., and Bennett, S.: On integrating machine learning with planning, in: A. Meyrowitz and S. Chipman (eds), Foundations of Knowledge Acquisition, Machine Learning, Kluwer Academic Publishers, 1993, pp. 85-116.
7. Erol, K., Nau, D. S., and Subrahmanian, V. S.: On the complexity of domain-independent planning, in: Proc. of 10th National Conf. on Artificial Intelligence, San Jose, CA, 1992, pp. 381-386.
8. Fennema, C. et. al.: Model-directed mobile robot navigation, IEEE Trans. Systems Man Cybernet. 20(6) (1990), 1352-1369.
9. Kavraki, L. and Latombe, J.: Randomized preprocessing of configuration space for fast path planning, in: Proc. IEEE Internat. Conf. on Robotics and Automation, San Diego, CA, 1994, pp. 2138-2145.
10. Kent, E. W.: Submetric formalism for task representation, Robotics Automat. Systems 9(1-2) (1991), 115-133.
11. 2, an object-oriented data model, in: Proc. of the ACM-SIGMOD Conf., Chicago, IL, 1988.
12. Lozano-Perez, T.: A simple motion-planning algorithm for general robot manipulators, IEEE Trans. Robotics Automat. RA-3(3) (1987), 224-238.
13. Lumelsky, V. J. and Stepanov, A. A.: Path planning strategies for a point mobile automaton moving admist unknown obstacles of arbitrary shape, Algorithmica 2 (1987), 403-430.
14. McDernott, D.: Regression planning, Internat. J. Intell. Systems 6 (1991), 357-416.
15. Nilsson, N. J.: Principles of Artificial Intelligence, Tioga (Press), Palo Alto, CA, 1980.
16. Sacerdoti, E. D.: A Structure for Plans and Behavior, Elsevier, North-Holland, Amsterdam, 1977.
17. Sheu, P. C. and Kashyap, R. L.: Programming robot systems with knowledge, Robotica and Computer-Integrated Manufacturing 4(3/4) (1988), 359-367.
18. Walther, C.: A mechanical solution of Schubert's steamroller by many-sorted resolution, in: Artificial Intelligence 26, Elsevier, Amsterdam, 1985, pp. 217-224.