REPRESENTING SPACE FOR PRACTICAL REASONING

被引:12
作者
FLECK, MM [1 ]
机构
[1] MIT,ARTIFICIAL INTELLIGENCE LAB,CAMBRIDGE,MA 02139
关键词
COMPUTER PROGRAMMING - Algorithms;
D O I
10.1016/0262-8856(88)90002-9
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The paper describes a new approach to representing space and time for practical reasoning, based on space-filling cells. The new models can represent a bounded region of space using only a finite number of cells, so they can be manipulated directly. They have useful notions of function continuity and region 'connectedness'. The topology of space is allowed to depend on the situation being represented, accounting for sharp changes in function values and lack of connectedness across object boundaries. Algorithms based on this model of space are neither purely region based nor purely boundary based, but a blend of the two. This new style of algorithm design is illustrated by a new program for finding edges in grey-scale images.
引用
收藏
页码:75 / 86
页数:12
相关论文
共 30 条
[1]  
Allen J.F., 1985, P 9 INT JOINT C ARTI, V1, P528
[2]   MAINTAINING KNOWLEDGE ABOUT TEMPORAL INTERVALS [J].
ALLEN, JF .
COMMUNICATIONS OF THE ACM, 1983, 26 (11) :832-843
[3]  
ALLEN JF, 1984, ARTIF INTELL, V23
[4]  
ASADA H, 1984, AIM758 MIT
[5]   ACCURACY OF LAPLACIAN EDGE DETECTORS [J].
BERZINS, V .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1984, 27 (02) :195-210
[6]  
BLAKE A, 1983, THESIS U EDINBURGH U
[7]   SMOOTHED LOCAL SYMMETRIES AND THEIR IMPLEMENTATION [J].
BRADY, M ;
ASADA, H .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 1984, 3 (03) :36-61
[8]   A SUBDIVISION ALGORITHM IN CONFIGURATION SPACE FOR FINDPATH WITH ROTATION [J].
BROOKS, RA ;
LOZANOPEREZ, T .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1985, 15 (02) :224-233
[10]  
CLARK JJ, UNPUB AUTHENTICATING