Abstract
Search space explosion is a critical problem in robot task planning. This problem limits current robot task planners to solve only simple block world problems and task planning in a real robot working environment to be impractical. This problem is mainly due to the lack of utilization of domain information in task planning. In this paper, we describe a fast task planner for indoor robot applications that effectively uses domain information to speed up the planning process. In this planner, domain information is explicitly represented in an object-oriented data model (OODM) that uses many-sorted logic (MSL) representation. The OODM is convenient for the management of complex data and many-sorted logic is effective for pruning in the rule search process. An inference engine is designed to take advantage of the salient features of these two techniques for fast task planning. A simulation example and complexity analysis are given to demonstrate the advantage of the proposed task planner.
Similar content being viewed by others
References
Bancilhon, F. and Khoshafian, S.: A calculus for complex objects, ACM PODS Conf., 1986, pp. 53–59.
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.
Chapman, D.: Planning for conjunctive goals, Artificial Intelligence 32 (1987), 333–377.
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.
Cohn, A. G.: Many-sorted logic D unsorted logic C control? in: M. Branur (ed.), Expert Systems 86, Cambridge Univ. Press, 1986, pp. 184–194.
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.
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.
Fennema, C. et. al.: Model-directed mobile robot navigation, IEEE Trans. Systems Man Cybernet. 20(6) (1990), 1352–1369.
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.
Kent, E. W.: Submetric formalism for task representation, Robotics Automat. Systems 9(1–2) (1991), 115–133.
Lecluse, C., Richard, P., and Velez, F.: O2, an object-oriented data model, in: Proc. of the ACM-SIGMOD Conf., Chicago, IL, 1988.
Lozano-Perez, T.: A simple motion-planning algorithm for general robot manipulators, IEEE Trans. Robotics Automat. RA-3(3) (1987), 224–238.
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.
McDernott, D.: Regression planning, Internat. J. Intell. Systems 6 (1991), 357–416.
Nilsson, N. J.: Principles of Artificial Intelligence, Tioga (Press), Palo Alto, CA, 1980.
Sacerdoti, E. D.: A Structure for Plans and Behavior, Elsevier, North-Holland, Amsterdam, 1977.
Sheu, P. C. and Kashyap, R. L.: Programming robot systems with knowledge, Robotica and Computer-Integrated Manufacturing 4(3/4) (1988), 359–367.
Walther, C.: A mechanical solution of Schubert's steamroller by many-sorted resolution, in: Artificial Intelligence 26, Elsevier, Amsterdam, 1985, pp. 217–224.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chien, Y.P., Hudli, A. & Palakal, M. Using Many-Sorted Logic in the Object-Oriented Data Model for Fast Robot Task Planning. Journal of Intelligent and Robotic Systems 23, 1–25 (1998). https://doi.org/10.1023/A:1008021418835
Issue Date:
DOI: https://doi.org/10.1023/A:1008021418835