Piecemeal Learning of an Unknown Environment,

reportActive / Technical Report | Accession Number: ADA291683 | Open PDF

Abstract:

We introduce a new learning problem leaning a graph by piecemeal search, in which the learner must return every so often to its starting point for refueling, say. We present two linear-time piecemeal-search algorithms for learning city-block graphs grid graphs with rectangular obstacles. AN

Author(s):
Betke, Margrit ; Rivest, Ronald L. ; Singh, Mona
Author Organization(s):
MASSACHUSETTS INST OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB
Supplementary Note:
Sponsored in part by Grant NSF-CCR93-10888. DOI: 10.21236/ADA291683
Pagination:
0015

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
AIM-1474, CBCL-93
Contract/Grant Number(s):
NSF-ASC92-17041, $NSF-CCR89-14428
Monitor Series:
ONR
 Subject Terms
Joint Capability Areas:
JCA_5_Command and Control; JCA_5.3_Planning; JCA_2_Battlespace Awareness; JCA_2.1_Planning and Direction; JCA_2.1.2_Develop Strategies; JCA_5.3.3_Develop Strategy; JCA_4.4.1_Food Service; JCA_4.4_Logistics Services; JCA_1.2.5_Lessons Learned; JCA_4.3_Maintain; JCA_5.5.2_Task; JCA_5.5_Direct; JCA_8_Building Partnerships
Modernization Areas:
Quantum Science and Computing
Communities of Interest:
Sensors
Descriptor(s):
*ARTIFICIAL INTELLIGENCE, *LEARNING, ALGORITHMS, OPTIMIZATION, GRAPHS, ROBOTS, GRIDS, PATHS, LEARNING MACHINES, BOUNDARIES, APPROXIMATION(MATHEMATICS), SEARCHING, BARRIERS
Field(s)/Group(s):
Cybernetics, Bionics
Report Date:
1994 Mar 01