MSB Karlstad

*000      am a        a
*00155244
*008      |        sw     e|     ||| 0|swe||
*041  $aeng
*084  $aP$2kssb/8
*084  $aPab$2kssb/8
*084  $aPueb$2kssb/8
*1001 $aHolmes, Peter D.
*24510$aHeuristic traversal of a free space graph /$cPeter D. Holmes, Erland Jungert
*260  $a[Stockholm] :$b[Försvarets forskningsanst].,$c[1989]
*300  $aS. 495-503 :$bill.
*490  $a(FOA report B],$x[0281-0263] ; $v[30158-3.4] ;
*500  $aSärtr. ur "Proceedings of the SPIE - The International Society for Optical Engineering. Volume 1003: Sensor fusion: spatial reasoning and scene interpretation, 7-9 November 1988, Cambridge, Massachussetts"
*500  $aSerieuppgifter från påklistrad etikett
*500  $aPlastmapp
*520  $bIn order to plan paths within a physical working space, effective data structures must be used for spatial representation. A free space graph is a data structure derived from a systematic decomposition of the unobstructed portions of the working space. For the two-dimensional case, this work describes an heuristic method for traversal and search of one particular type of free space graph. The focus herein regards the "dialogue" between an A* search process and an inference engine whose rules employ spatial operators for classification of local topologies within the free space graph. This knowledge-based technique is used to generate plans which describe admissible sequences of movement between selected start and goal configurations
*650 7$aTeknisk optik$2sao
*650 7$aDatorgrafik$2sao
*650 7$aDatorprogram$2sao
*7001 $aJungert, Erland,$d1942-
*852  $cP
^