Abstract | ||
---|---|---|
This paper presents a general method for structuring domains that is based on the notion of locality. We consider a localized domain description to be one that is partitioned into regions of activity, each of which has some independent significance. The use of locality can be very beneficial for domain representation and reasoning, especially for parallel, muItiagent domains. We show how localized domain descriptions can alleviate aspects of the frame problem and serve as the foundation of a planning technique based on localized planning spaces. Because domain constraints and properties are localized, potential interactions among these search spaces are fewer and more easily identified. |
Year | Venue | Keywords |
---|---|---|
1987 | AAAI | localized representation,potential interaction,muitiagent domain,domain constraint,localized domain description,domain representation,parallel domain,independent significance,localized planning space,frame problem,general method,planning technique,search space |
Field | DocType | ISBN |
Mathematical optimization,Locality,Computer science,Structuring,Frame problem | Conference | 0-934613-42-7 |
Citations | PageRank | References |
17 | 22.60 | 9 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
amy l lansky | 1 | 494 | 184.77 |
David S. Fogelsong | 2 | 17 | 22.60 |