Intelligent planning: a decomposition and abstraction based approach
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Berlin [u.a.]
Springer
1997
|
| Series: | Artificial intelligence
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | XXII, 252 S. graph. Darst. |
| ISBN: | 3540619011 |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV011117709 | ||
| 003 | DE-604 | ||
| 005 | 20170711 | ||
| 007 | t | ||
| 008 | 961209s1997 gw d||| |||| 00||| eng d | ||
| 016 | 7 | |a 949221988 |2 DE-101 | |
| 020 | |a 3540619011 |c Pp. : DM 68.00 |9 3-540-61901-1 | ||
| 035 | |a (OCoLC)845318046 | ||
| 035 | |a (DE-599)BVBBV011117709 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-20 |a DE-19 |a DE-91G |a DE-824 |a DE-384 |a DE-706 |a DE-521 |a DE-522 |a DE-526 |a DE-634 |a DE-83 | ||
| 050 | 0 | |a Q334.Y36 1997 | |
| 082 | 0 | |a 006.3 21 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a ST 300 |0 (DE-625)143650: |2 rvk | ||
| 084 | |a ST 690 |0 (DE-625)143691: |2 rvk | ||
| 084 | |a DAT 716f |2 stub | ||
| 084 | |a DAT 060f |2 stub | ||
| 084 | |a 28 |2 sdnb | ||
| 100 | 1 | |a Yang, Qiang |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Intelligent planning |b a decomposition and abstraction based approach |c Qiang Yang |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 1997 | |
| 300 | |a XXII, 252 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Artificial intelligence | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Künstliche Intelligenz | |
| 650 | 4 | |a Artificial intelligence -- Congresses | |
| 650 | 4 | |a Planning -- Data processing -- Congresses | |
| 650 | 0 | 7 | |a Automatische Handlungsplanung |0 (DE-588)4211191-2 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Automatische Handlungsplanung |0 (DE-588)4211191-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007450050&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007450050 | |
Record in the Search Index
| _version_ | 1807683743115116544 |
|---|---|
| adam_text |
TABLE
OF
CONTENTS
1.
INTRODUCTION
.
1
1.1
THE
PROBLEM
.
1
1.2
KEY
ISSUES
.
1
1.3
PLANNING
VERSUS
SCHEDULING
.
4
1.4
CONTRIBUTIONS
AND
ORGANIZATION
.
6
1.5
BACKGROUND
.
8
PART
I.
REPRESENTATION,
BASIC
ALGORITHMS,
AND
ANALYTICAL
TECHNIQUES
2.
REPRESENTATION
AND
BASIC
ALGORITHMS
.
15
2.1
BASIC
REPRESENTATION
.
15
2.1.1
DOMAIN
DESCRIPTION
.
15
2.1.2
PARTIAL-ORDER
AND
PARTIAL-INSTANTIATION
PLANS
.
17
2.2
BASIC
PLANNING
ALGORITHMS
.
19
2.3
PARTIAL-ORDER,
BACKWARD-CHAINING
ALGORITHMS
.
20
2.3.1
CORRECTNESS
.
21
2.3.2
THREAT
DETECTION
AND
RESOLUTION
.
23
2.3.3
ESTABLISHING
PRECONDITIONS
.
23
2.3.4
A
HOUSE-PAINTING
EXAMPLE
.
25
2.4
TOTAL-ORDER,
FORWARD-CHAINING
ALGORITHMS
.
27
2.5
MORE
ADVANCED
OPERATOR
REPRESENTATIONS
.
29
2.6
SEARCH
CONTROL
.
31
2.7
SATISFACTION
BASED
METHODS
.
32
2.7.1
OVERVIEW
.
32
2.7.2
MODEL
DEFINITION
.
33
2.7.3
MODEL
SATISFACTION
AND
PLAN
CONSTRUCTION
.
35
2.8
BACKGROUND
.
37
3.
ANALYTICAL
TECHNIQUES
.
39
3.1
BASIC
ANALYTICAL
TECHNIQUES
.
39
3.2
ANALYZING
FORWARD-CHAINING,
TOTAL-ORDER
PLANNERS
.
40
3.3
ANALYZING
PARTIAL-ORDER
PLANNERS
.
41
XII
TABLE
OF
CONTENTS
3.4
CASE
STUDY:
AN
ANALYSIS
OF
T
WEAK
.
44
3.4.1
AN
IMPLEMENTATION
OF
T
WEAK
.
44
3.4.2
ANALYZING
T
WEAK
.
46
3.5
CRITICS
OF
BASIC
PLANNERS
.
46
3.6
BACKGROUND
.
47
4.
USEFUL
SUPPORTING
ALGORITHMS
.
49
4.1
PROPOSITIONAL
UNIFICATION
ALGORITHM
.
49
4.2
GRAPH
ALGORITHMS
.
51
4.3
DYNAMIC
PROGRAMMING
.
54
4.4
BRANCH
AND
BOUND
.
56
4.5
CONSTRAINT
SATISFACTION
.
58
4.5.1
LOCAL-CONSISTENCY
BASED
METHODS
.
59
4.5.2
BACKTRACK-FREE
ALGORITHM
.
60
4.5.3
BACKTRACK-BASED
ALGORITHMS
.
61
4.6
THE
G
SAT
ALGORITHM
.
64
4.7
BACKGROUND
.
66
5.
CASE
STUDY:
COLLECTIVE
RESOURCE
REASONING
.
67
5.1
EAGER
VARIABLE-BINDING
COMMITMENTS
.
67
5.2
EXTENDING
THE
REPRESENTATION
.
69
5.3
PLAN
GENERATION
.
71
5.3.1
CORRECTNESS
CHECK
.
71
5.3.2
THREAT
DETECTION
.
71
5.3.3
PRECONDITION
ESTABLISHMENT
.
72
5.4
A
HOUSE-PAINTING
EXAMPLE
.
72
5.5
A
VARIABLE-SIZED
BLOCKS
WORLD
DOMAIN
.
76
5.6
SUMMARY
.
78
5.7
BACKGROUND
.
78
PART
II.
PROBLEM
DECOMPOSITION
AND
SOLUTION
COMBINATION
6.
PLANNING
BY
DECOMPOSITION
.
85
6.1
DECOMPOSITION
PLANNING
.
85
6.1.1
TWO
EXAMPLES
.
85
6.1.2
GLOBAL
PLANNING-DOMAIN
DECOMPOSITION
.
86
6.2
EFFICIENCY
BENEFITS
OF
DECOMPOSITION
.
87
6.2.1
FORWARD-CHAINING,
TOTAL-ORDER
PLANNERS
.
87
6.2.2
BACKWARD-CHAINING,
PARTIAL-ORDER
PLANNERS
.
90
6.2.3
CRITERIA
FOR
GOOD
DECOMPOSITION
.
92
6.3
GOAL-DIRECTED
DECOMPOSITION:
THE
GDECOMP
ALGORITHM
.
92
6.4
OTHER
BENEFITS
OF
DECOMPOSITION
.
95
6.5
ALTERNATIVE
APPROACHES
TO
DECOMPOSITION
PLANNING
.
95
TABLE
OF
CONTENTS
XIII
6.6
SUMMARY
.
99
6.7
BACKGROUND
.
100
7.
GLOBAL
CONFLICT
RESOLUTION
.
101
7.1
GLOBAL
CONFLICT
RESOLUTION
-
AN
OVERVIEW
.
101
7.2
CONFLICT
RESOLUTION
CONSTRAINTS
.
102
7.2.1
CONFLICTS
AND
CONFLICT
RESOLUTION
METHODS
.
102
7.2.2
RELATIONS
AMONG
CONFLICT
RESOLUTION
METHODS
.
104
7.3
CONFLICT
RESOLUTION
AS
CONSTRAINT
SATISFACTION
.
106
7.3.1
REPRESENTATION
.
106
7.3.2
PROPAGATING
CONSTRAINTS
AMONG
CONFLICTS
.
107
7.3.3
REDUNDANCY
REMOVAL
VIA
SUBSUMPTION
RELATIONS
.
107
7.4
THE
PAINTING
EXAMPLE
.
110
7.5
WHEN
IS
THE
CONSTRAINT-BASED
METHOD
USEFUL?
.
112
7.6
THE
C
OMBINE
ALGORITHM
.
112
7.7
RELATED
WORK
.
115
7.7.1
OVERVIEW
OF
PREVIOUS
WORK
.
115
7.7.2
RELATED
WORK
BY
SMITH
AND
PEOT
.
116
7.7.3
RELATED
WORK
BY
ETZIONI
.
118
7.8
OPEN
PROBLEMS
.
118
7.9
SUMMARY
.
119
7.10
BACKGROUND
.
120
8.
PLAN
MERGING
.
121
8.1
THE
VALUE
OF
PLAN
MERGING
.
121
8.2
FORMAL
DESCRIPTION
.
123
8.2.1
A
FORMAL
DEFINITION
FOR
PLAN
MERGING
.
123
8.2.2
AN
EXAMPLE
.
125
8.2.3
IMPACT
ON
CORRECTNESS
.
126
8.3
COMPLEXITY
OF
PLAN
MERGING
.
128
8.3.1
DECIDING
WHAT
TO
MERGE
.
128
8.3.2
DECIDING
HOW
TO
MERGE
.
129
8.4
OPTIMAL
PLAN
MERGING
.
130
8.5
APPROXIMATE
PLAN
MERGING
.
133
8.5.1
ALGORITHM
A
PPROX
M
ERGE
.
134
8.5.2
EXAMPLE
.
134
8.5.3
COMPLEXITY
.
135
8.6
RELATED
WORK
.
136
8.6.1
CRITICS
IN
N
OAH
,
S
IPE
,
AND
N
ONLIN
.
136
8.6.2
M
ACHINIST
.
137
8.6.3
OPERATOR
OVERLOADING
.
138
8.7
OPEN
PROBLEMS
.
138
8.7.1
ORDER-DEPENDENT
COST
FUNCTIONS
.
138
8.7.2
HIERARCHICAL
PLAN
MERGING
.
138
8.7.3
ENHANCING
CONFLICT
RESOLUTION
.
139
XIV
TABLE
OF
CONTENTS
8.8
SUMMARY
.
139
8.9
BACKGROUND
.
139
9.
MULTIPLE-GOAL
PLAN
SELECTION
.
141
9.1
CONSISTENCY-BASED
PLAN
SELECTION
.
141
9.1.1
THE
MULTIPLE-GOAL
PLAN-SELECTION
PROBLEM
.
141
9.1.2 A
CSP
REPRESENTATION
.
142
9.1.3
A
CONSTRAINT-BASED
SOLUTION
.
142
9.1.4
EVALUATION
-
A
BLOCKS-WORLD
EXAMPLE
.
144
9.2
OPTIMIZATION-BASED
PLAN
SELECTION
.
146
9.2.1
EXAMPLES
.
147
9.2.2
COMPLEXITY
.
148
9.2.3
A
HEURISTIC
ALGORITHM
FOR
PLAN
SELECTION
.
149
9.2.4
EXAMPLES
.
153
9.2.5
EMPIRICAL
RESULTS
IN
A
MANUFACTURING
PLANNING
DOMAIN
.
155
9.3
OPEN
PROBLEMS
.
156
9.4
SUMMARY
.
157
9.5
BACKGROUND
.
157
PART
III.
HIERARCHICAL
ABSTRACTION
10.
HIERARCHICAL
PLANNING
.
163
10.1
A
HIERARCHICAL
PLANNER
.
164
10.1.1
ALGORITHM
.
164
10.1.2
PRECONDITION-ELIMINATION
ABSTRACTION
.
165
10.2
SPECIFYING
REFINEMENT
.
171
10.2.1
FORWARD-CHAINING,
TOTAL-ORDER
REFINEMENT
.
171
10.2.2
BACKWARD-CHAINING,
PARTIAL-ORDER
REFINEMENT
.
172
10.3
PROPERTIES
OF
AN
ABSTRACTION
HIERARCHY
.
174
10.3.1
EXISTENCE-BASED
PROPERTIES
.
174
10.3.2
REFINEMENT-BASED
PROPERTIES
.
175
10.4
AN
ANALYTICAL
MODEL
.
179
10.4.1
ASSUMPTIONS
.
180
10.4.2
THE
PROBABILITY
OF
REFINEMENT
.
183
10.4.3
ANALYTICAL
RESULT
.
184
10.5
OPEN
PROBLEMS
.
187
10.6
SUMMARY
.
187
10.7
BACKGROUND
.
188
11.
GENERATING
ABSTRACTION
HIERARCHIES
.
189
11.1
SYNTACTIC
CONNECTIVITY
CONDITIONS
.
189
11.2
H
IPOINT
.
192
11.2.1
A
LPINE
.
194
TABLE
OF
CONTENTS
XV
11.2.2
PROBABILITY
ESTIMATES
.
196
11.2.3
COLLAPSING
NODES
WITH
LOW
REFINEMENT
PROBABILITIES
.
199
11.2.4
AUGMENTED
TOPOLOGICAL
SORT
OF
ABSTRACTION
GRAPH
.
200
11.3
EMPIRICAL
RESULTS
IN
THE
BOX
DOMAIN
.
200
11.4
RELATED
WORK
ON
ABSTRACTION
GENERATION
.
203
11.5
OPEN
PROBLEMS
.
204
11.6
SUMMARY
.
206
11.7
BACKGROUND
.
206
12.
PROPERTIES
OF
TASK
REDUCTION
HIERARCHIES
.
207
12.1
DEFINING
OPERATOR
REDUCTION
.
208
12.2
UPWARD
SOLUTION
PROPERTY
.
213
12.2.1
LOSING
THE
PROPERTY
.
213
12.2.2
A
VARIABLE-ASSIGNMENT
EXAMPLE
.
214
12.2.3
THE
CHINESE
BEAR
EXAMPLE
.
214
12.3
IMPOSING
RESTRICTIONS
.
216
12.3.1
MOTIVATION
.
216
12.3.2
UNRESOLVABLE
CONFLICTS
.
217
12.3.3
THE
UNIQUE-MAIN-SUBACTION
RESTRICTION
.
217
12.4
PREPROCESSING
.
219
12.5
MODIFYING
OPERATOR-REDUCTION
SCHEMATA
.
219
12.6
OPEN
PROBLEMS
.
221
12.7
SUMMARY
.
223
12.8
BACKGROUND
.
223
13.
EFFECT
ABSTRACTION
.
225
13.1
A
MOTIVATING
EXAMPLE
.
225
13.2
PRIMARY-EFFECT
RESTRICTED
PLANNING
.
226
13.3
INCOMPLETENESS
AND
SUB-OPTIMAL
SOLUTIONS
.
229
13.4
AN
INDUCTIVE
LEARNING
ALGORITHM
.
230
13.5
HOW
MANY
TRAINING
EXAMPLES
.
233
13.5.1
INFORMAL
DESCRIPTION
.
233
13.5.2
A
BRIEF
INTRODUCTION
TO
PAC
LEARNING
.
233
13.5.3
APPLICATION
OF
THE
PAC
MODEL
.
235
13.6
OPEN
PROBLEMS
.
236
13.7
SUMMARY
.
237
13.8
BACKGROUND
.
237
REFERENCES
.
239
INDEX
.
249 |
| any_adam_object | 1 |
| author | Yang, Qiang |
| author_facet | Yang, Qiang |
| author_role | aut |
| author_sort | Yang, Qiang |
| author_variant | q y qy |
| building | Verbundindex |
| bvnumber | BV011117709 |
| callnumber-first | Q - Science |
| callnumber-label | Q334 |
| callnumber-raw | Q334.Y36 1997 |
| callnumber-search | Q334.Y36 1997 |
| callnumber-sort | Q 3334 Y36 41997 |
| callnumber-subject | Q - General Science |
| classification_rvk | ST 134 ST 300 ST 690 |
| classification_tum | DAT 716f DAT 060f |
| ctrlnum | (OCoLC)845318046 (DE-599)BVBBV011117709 |
| dewey-full | 006.321 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 006 - Special computer methods |
| dewey-raw | 006.3 21 |
| dewey-search | 006.3 21 |
| dewey-sort | 16.3 221 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV011117709</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170711</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961209s1997 gw d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">949221988</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540619011</subfield><subfield code="c">Pp. : DM 68.00</subfield><subfield code="9">3-540-61901-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)845318046</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011117709</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-522</subfield><subfield code="a">DE-526</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">Q334.Y36 1997</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">006.3 21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 300</subfield><subfield code="0">(DE-625)143650:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 690</subfield><subfield code="0">(DE-625)143691:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 716f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 060f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">28</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Yang, Qiang</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Intelligent planning</subfield><subfield code="b">a decomposition and abstraction based approach</subfield><subfield code="c">Qiang Yang</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXII, 252 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Künstliche Intelligenz</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence -- Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Planning -- Data processing -- Congresses</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatische Handlungsplanung</subfield><subfield code="0">(DE-588)4211191-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Automatische Handlungsplanung</subfield><subfield code="0">(DE-588)4211191-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007450050&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007450050</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift |
| id | DE-604.BV011117709 |
| illustrated | Illustrated |
| indexdate | 2024-08-18T00:39:15Z |
| institution | BVB |
| isbn | 3540619011 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007450050 |
| oclc_num | 845318046 |
| open_access_boolean | |
| owner | DE-20 DE-19 DE-BY-UBM DE-91G DE-BY-TUM DE-824 DE-384 DE-706 DE-521 DE-522 DE-526 DE-634 DE-83 |
| owner_facet | DE-20 DE-19 DE-BY-UBM DE-91G DE-BY-TUM DE-824 DE-384 DE-706 DE-521 DE-522 DE-526 DE-634 DE-83 |
| physical | XXII, 252 S. graph. Darst. |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Springer |
| record_format | marc |
| series2 | Artificial intelligence |
| spelling | Yang, Qiang Verfasser aut Intelligent planning a decomposition and abstraction based approach Qiang Yang Berlin [u.a.] Springer 1997 XXII, 252 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Artificial intelligence Datenverarbeitung Künstliche Intelligenz Artificial intelligence -- Congresses Planning -- Data processing -- Congresses Automatische Handlungsplanung (DE-588)4211191-2 gnd rswk-swf (DE-588)1071861417 Konferenzschrift gnd-content Automatische Handlungsplanung (DE-588)4211191-2 s DE-604 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007450050&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Yang, Qiang Intelligent planning a decomposition and abstraction based approach Datenverarbeitung Künstliche Intelligenz Artificial intelligence -- Congresses Planning -- Data processing -- Congresses Automatische Handlungsplanung (DE-588)4211191-2 gnd |
| subject_GND | (DE-588)4211191-2 (DE-588)1071861417 |
| title | Intelligent planning a decomposition and abstraction based approach |
| title_auth | Intelligent planning a decomposition and abstraction based approach |
| title_exact_search | Intelligent planning a decomposition and abstraction based approach |
| title_full | Intelligent planning a decomposition and abstraction based approach Qiang Yang |
| title_fullStr | Intelligent planning a decomposition and abstraction based approach Qiang Yang |
| title_full_unstemmed | Intelligent planning a decomposition and abstraction based approach Qiang Yang |
| title_short | Intelligent planning |
| title_sort | intelligent planning a decomposition and abstraction based approach |
| title_sub | a decomposition and abstraction based approach |
| topic | Datenverarbeitung Künstliche Intelligenz Artificial intelligence -- Congresses Planning -- Data processing -- Congresses Automatische Handlungsplanung (DE-588)4211191-2 gnd |
| topic_facet | Datenverarbeitung Künstliche Intelligenz Artificial intelligence -- Congresses Planning -- Data processing -- Congresses Automatische Handlungsplanung Konferenzschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007450050&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT yangqiang intelligentplanningadecompositionandabstractionbasedapproach |