This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Map Learning and Clustering in Autonomous Systems
December 1993 (vol. 15 no. 12)
pp. 1286-1297

Building autonomous systems, self-learning while moving in an unknown environment, finds a variety of challenging applications. This paper presents a new approach, called clustering by discovery, for identification of clusters in a map which is being learned by exploration. The concomitance of exploration and clustering, we argue, is a mandatory feature for an autonomous system, hence the clustering technique we propose is an incremental process performed while the system is learning the map. Clusters supply an abstract description of the environment and can be used to decrease the complexity of the navigational tasks. The environment is viewed as a map of distinctive places which we assume to be sensed and recognized by the system. The presence of distinctive places and the environment scale are the only facts which we assume known apriori to the system. Clustering by discovery is based on a heuristic indicator called scattering, whose increment is minimized at each exploration step compatibly with a connectivity constraint imposed on clusters. Scattering is defined according to a number of functional and structural requirements. Two variants are presented, and their performance is discussed on a sample of maps including a real urban map and some randomly generated ones. In particular, one of the variants shows robust behaviour in terms of independence of the exploration strategy adopted.

[1] B. B. Chaudhuri, "Optimal circular fit to objects in two and three dimensions,"Pattern Recognit. Lett., vol. 11, no. 8, pp. 571-574, 1990.
[2] B. B. Chaudhuri and G. P. Samanta, "Elliptical fit of objects in two and three dimensions by moment of inertia optimization,"Pattern Recognit. Lett., vol. 12, no. 1, pp. 1-7, 1991.
[3] P. Ciaccia, D. Maio, and S. Rizzi, "Integrating knowledge-based systems and neural networks for navigational tasks,"Proc. IEEE COMPEURO, Bologna, Italy, pp. 652-656, 1991.
[4] E. Davis, "Organizing spatial knowledge," Dept. Computer Sci., Yale Univ., New Haven, CT, Res. Rep. No. 193, 1981.
[5] M. R. Garey and D. S. Johnson,Computer and Intractability. New York: Freeman, 1979.
[6] K. W. Haase Jr., "Discovery systems," in B. Du Boulay, D. Hogg, and L. Steels, Eds.Advances In Artificial Intelligence, vol. II. New York: Elsevier, 1987, pp. 111-120.
[7] M. A. W. Houtsma, P. M. G. Apers, and S. Ceri, "Complex transitive closure queries on a fragmented graph,"Proc. ICDT 90, Paris, France, 1990, pp. 470-484.
[8] J. M. Jolion, P. Meer and S. Bataouche, "Robust clustering with applications in computer vision,"IEEE Trans. Pattern Anal. Machine Intell., vol. 13, no. 8, pp. 791-802, 1991.
[9] B. J. Kuipers and Y. T. Byun, "A robust, qualitative method for robot spatial learning,"Proc. AAAI88, St. Paul, MN, vol. 2, pp. 774-779, 1988.
[10] D. B. Lenat, "Eurisko: a program which learns new heuristics and domain concepts",Artificial Intell., no. 21, 1983.
[11] D. Maio and S. Rizzi, "Clustering by discovery on maps,"Pattern Recognit. Lett., vol. 13, no. 2, pp. 89-94, 1992.
[12] D. McDermott, "Spatial inferences with ground, metric formulas on simple objects," Dept. Comput. Sci., Yale Univ., New Haven, CT, 1980, Research Rep. No. 173.
[13] H. Niemann and R. Goppert, "An efficient branch-and-bound nearest neighbor classifier,"Pattern Recognit. Lett., vol. 7, no. 2, pp. 67-72, 1988.
[14] D. Nitzan, "Development of intelligent robots: achievements and issues,"IEEE J. Robotics Automat., vol. RA-1, no. 1, pp. 3-13, 1985.
[15] N. S. V. Rao, "Algorithmic framework for learned robot navigation in unknown terrains,"IEEE Trans. Comput., vol. 38, pp. 37-43, Jan. 1989.
[16] K. Rose, E. Gurewitz, and G. Fox, "A deterministic annealing approach to clustering,"Pattern Recognit. Lett., vol. 11, no. 9, pp. 589-594, 1990.
[17] J. T. Tou and R. C. Gonzalez,Pattern Recognition Principles. Reading, MA: Addison-Wesley, 1974.
[18] C. R. Weisbin, G. De Saussure, J. R. Einstein, and F. G. Pin, "Autonomous mobile robot navigation and learning,"IEEE Trans. Comput., vol. 38, pp. 29-35, Jan. 1989.
[19] F. F. Yao, "Computational geometry," in J. Van Leeuwen, Ed.Handbook of Theoretical Computer Science, vol. A. New York: Elsevier, 1990, pp. 345-389.
[20] D. Zipser, "Biologically plausible models of place recognition and goal location," in D. E. Rumelhart and J. L. McClelland, Eds.Parallel Distributed Processing, vol. II. Cambridge, MA: MIT Press, 1986, pp. 432-470.

Index Terms:
map learning; map clustering; autonomous systems; self-learning systems; discovery; exploration; navigational tasks; heuristic; heuristic programming; learning systems; pattern recognition; self-adjusting systems
Citation:
D. Maio, S. Rizzi, "Map Learning and Clustering in Autonomous Systems," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 15, no. 12, pp. 1286-1297, Dec. 1993, doi:10.1109/34.250846
Usage of this product signifies your acceptance of the Terms of Use.