Librarian View
Last updated in SearchWorks on December 3, 2023 5:50pm
LEADER 08520cam a2200997Ia 4500
001
a14250490
003
SIRSI
006
m eo d
007
cr cn||||m|||a
008
130719s2013 sz a fob 000 0 eng d
035
a| (Sirsi) a14250490
040
a| CaBNvSL
b| eng
e| pn
c| J2I
d| J2I
d| N$T
d| UIU
d| WAU
d| OCLCA
d| YDXCP
d| E7B
d| OCLCA
d| UMI
d| UKMGB
d| DEBSZ
d| COO
d| EBLCP
d| CN3GA
d| OCLCQ
d| AZK
d| LND
d| OCLCF
d| CEF
d| INT
d| OCLCQ
d| WYU
d| YOU
d| OCLCQ
d| LEAUB
d| NJT
d| OCLCQ
d| UKSSU
d| S2H
d| OCLCO
d| OCLCQ
d| UKAHL
d| OCLCO
d| GW5XE
d| CSt
016
7
a| 016563866
2| Uk
020
a| 9781608459704
q| (electronic bk.)
020
a| 1608459705
q| (electronic bk.)
020
a| 1608459691
020
a| 9781608459698
020
z| 9781608459698
q| (pbk.)
020
a| 9783031015649
q| (electronic bk.)
020
a| 3031015649
q| (electronic bk.)
024
7
a| 10.2200/S00513ED1V01Y201306AIM022
2| doi
024
7
a| 10.1007/978-3-031-01564-9
2| doi
035
a| (OCoLC)853278184
z| (OCoLC)851972580
z| (OCoLC)863709979
z| (OCoLC)961502988
z| (OCoLC)962653996
037
a| CL0500000340
b| Safari Books Online
050
4
a| Q335
b| .G443 2013
072
7
a| COM
x| 005030
2| bisacsh
072
7
a| COM
x| 004000
2| bisacsh
082
0
4
a| 006.3
2| 23
084
a| TEC031000
2| bisacsh
049
a| MAIN
100
1
a| Geffner, Hector.
245
1
2
a| A concise introduction to models and methods for automated planning /
c| Hector Geffner, Blai Bonet.
260
a| Cham, Switzerland :
b| Springer,
c| ©2013.
300
a| 1 online resource (xii, 129 pages) :
b| illustrations
336
a| text
b| txt
2| rdacontent
337
a| computer
b| c
2| rdamedia
338
a| online resource
b| cr
2| rdacarrier
490
1
a| Synthesis lectures on artificial intelligence and machine learning,
x| 1939-4616 ;
v| #22
500
a| Part of: Synthesis digital library of engineering and computer science.
588
0
a| Online resource; title from PDF title page (Morgan & Claypool, viewed on July 18, 2013).
504
a| Includes bibliographical references (pages 113-127).
505
0
a| 1. Planning and autonomous behavior -- 1.1 Autonomous behavior: hardwired, learned, and model-based -- 1.2 Planning models and languages -- 1.3 Generality, complexity, and scalability -- 1.4 Examples -- 1.5 Generalized planning: plans vs. general strategies -- 1.6 History.
505
8
a| 2. Classical planning: full information and deterministic actions -- 2.1 Classical planning model -- 2.2 Classical planning as path finding -- 2.3 Search algorithms: blind and heuristic -- 2.4 Online search: thinking and acting interleaved -- 2.5 Where do heuristics come from? -- 2.6 Languages for classical planning -- 2.7 Domain-independent heuristics and relaxations -- 2.8 Heuristic search planning -- 2.9 Decomposition and goal serialization -- 2.10 Structure, width, and complexity.
505
8
a| 3. Classical planning: variations and extensions -- 3.1 Relaxed plans and helpful actions -- 3.2 Multi-queue best-first search -- 3.3 Implicit subgoals: landmarks -- 3.4 State-of-the-art classical planners -- 3.5 Optimal planning and admissible heuristics -- 3.6 Branching schemes and problem spaces -- 3.7 Regression planning -- 3.8 Planning as SAT and constraint satisfaction -- 3.9 Partial-order causal link planning -- 3.10 Cost, metric, and temporal planning -- 3.11 Hierarchical task networks.
505
8
a| 4. Beyond classical planning: transformations -- 4.1 Soft goals and rewards -- 4.2 Incomplete information -- 4.3 Plan and goal recognition -- 4.4 Finite-state controllers -- 4.5 Temporally extended goals.
505
8
a| 5. Planning with sensing: logical models -- 5.1 Model and language -- 5.2 Solutions and solution forms -- 5.3 Offline solution methods -- 5.4 Online solution methods -- 5.5 Belief tracking: width and complexity -- 5.6 Strong vs. strong cyclic solutions.
505
8
a| 6. MDP planning: stochastic actions and full feedback -- 6.1 Goal, shortest-path, and discounted models -- 6.2 Dynamic programming algorithms -- 6.3 Heuristic search algorithms -- 6.4 Online MDP planning -- 6.5 Reinforcement learning, model-based RL, and planning.
505
8
a| 7. POMDP planning: stochastic actions and partial feedback -- 7.1 Goal, shortest-path, and discounted POMDPs -- 7.2 Exact offline algorithms -- 7.3 Approximate and online algorithms -- 7.4 Belief tracking in POMDPs -- 7.5 Other MDP and POMDP solution methods.
505
8
a| 8. Discussion -- 8.1 Challenges and open problems -- 8.2 Planning, scalability, and cognition.
505
8
a| Bibliography -- Author's biography.
510
0
a| Compendex
510
0
a| INSPEC
510
0
a| Google scholar
510
0
a| Google book search
520
3
a| Planning is the model-based approach to autonomous behavior where the agent behavior is derived automatically from a model of the actions, sensors, and goals. The main challenges in planning are computational as all models, whether featuring uncertainty and feedback or not, are intractable in the worst case when represented in compact form. In this book, we look at a variety of models used in AI planning, and at the methods that have been developed for solving them. The goal is to provide a modern and coherent view of planning that is precise, concise, and mostly self-contained, without being shallow. For this, we make no attempt at covering the whole variety of planning approaches, ideas, and applications, and focus on the essentials. The target audience of the book are students and researchers interested in autonomous behavior and planning from an AI, engineering, or cognitive science perspective.
650
0
a| Planning
x| Automation.
650
0
a| Planning
x| Computer simulation.
650
0
a| Artificial intelligence.
650
6
a| Planification
x| Automatisation.
650
6
a| Planification
x| Simulation par ordinateur.
650
6
a| Intelligence artificielle.
650
7
a| artificial intelligence.
2| aat
650
7
a| COMPUTERS
x| Enterprise Applications
x| Business Intelligence Tools.
2| bisacsh
650
7
a| COMPUTERS
x| Intelligence (AI) & Semantics.
2| bisacsh
650
7
a| Artificial intelligence.
2| fast
0| (OCoLC)fst00817247
653
a| planning
653
a| autonomous behavior
653
a| model-based control
653
a| plan generation and recognition
653
a| MDP and POMDP planning
653
a| planning with incomplete information and sensing
653
a| action selection
653
a| belief tracking
653
a| domain-independent problem solving
700
1
a| Bonet, Blai
c| (Computer scientist)
776
0
8
i| Print version:
z| 9781608459698
830
0
a| Synthesis lectures on artificial intelligence and machine learning ;
v| #22.
x| 1939-4608
856
4
0
z| Available to Stanford-affiliated users.
u| https://link.springer.com/10.1007/978-3-031-01564-9
x| WMS
y| SpringerLink
x| Provider: Springer
x| purchased
x| eLoaderURL
x| sp4
x| spocn853278184
994
a| 92
b| STF
905
0
a| Preface Planning and Autonomous Behavior Classical Planning: Full Information and Deterministic Actions Classical Planning: Variations and Extensions Beyond Classical Planning: Transformations Planning with Sensing: Logical Models MDP Planning: Stochastic Actions and Full Feedback POMDP Planning: Stochastic Actions and Partial Feedback Discussion Bibliography Author's Biography.
1| Nielsen
x| 9781608459698
x| 20220711
920
b| Planning is the model-based approach to autonomous behavior where the agent behavior is derived automatically from a model of the actions, sensors, and goals. The main challenges in planning are computational as all models, whether featuring uncertainty and feedback or not, are intractable in the worst case when represented in compact form. In this book, we look at a variety of models used in AI planning, and at the methods that have been developed for solving them. The goal is to provide a modern and coherent view of planning that is precise, concise, and mostly self-contained, without being shallow. For this, we make no attempt at covering the whole variety of planning approaches, ideas, and applications, and focus on the essentials. The target audience of the book are students and researchers interested in autonomous behavior and planning from an AI, engineering, or cognitive science perspective.
1| Nielsen
x| 9781608459698
x| 20220711
596
a| 22
035
a| (Sirsi) spocn853278184
999
f
f
i| 27260f83-8113-50f0-9a44-cb94d46ee4d4
s| 54a71530-4a05-5fd4-bd8e-112c656a3d89
Holdings JSON
{
"holdings": [
{
"id": "a1b08068-6955-5863-bdd5-aa0eba08c460",
"hrid": "ah14250490_1",
"notes": [
],
"_version": 1,
"metadata": {
"createdDate": "2023-08-21T21:26:32.450Z",
"updatedDate": "2023-08-21T21:26:32.450Z",
"createdByUserId": "58d0aaf6-dcda-4d5e-92da-012e6b7dd766",
"updatedByUserId": "58d0aaf6-dcda-4d5e-92da-012e6b7dd766"
},
"sourceId": "f32d531e-df79-46b3-8932-cdd35f7a2264",
"boundWith": null,
"formerIds": [
],
"illPolicy": null,
"instanceId": "27260f83-8113-50f0-9a44-cb94d46ee4d4",
"holdingsType": {
"id": "996f93e2-5b5e-4cf2-9168-33ced1f95eed",
"name": "Electronic",
"source": "folio"
},
"holdingsItems": [
],
"callNumberType": null,
"holdingsTypeId": "996f93e2-5b5e-4cf2-9168-33ced1f95eed",
"electronicAccess": [
],
"bareHoldingsItems": [
],
"holdingsStatements": [
],
"statisticalCodeIds": [
],
"administrativeNotes": [
],
"effectiveLocationId": "b0a1a8c3-cc9a-487c-a2ed-308fc3a49a91",
"permanentLocationId": "b0a1a8c3-cc9a-487c-a2ed-308fc3a49a91",
"suppressFromDiscovery": false,
"holdingsStatementsForIndexes": [
],
"holdingsStatementsForSupplements": [
],
"location": {
"effectiveLocation": {
"id": "b0a1a8c3-cc9a-487c-a2ed-308fc3a49a91",
"code": "SUL-ELECTRONIC",
"name": "online resource",
"campus": {
"id": "c365047a-51f2-45ce-8601-e421ca3615c5",
"code": "SUL",
"name": "Stanford Libraries"
},
"details": {
},
"library": {
"id": "c1a86906-ced0-46cb-8f5b-8cef542bdd00",
"code": "SUL",
"name": "SUL"
},
"isActive": true,
"institution": {
"id": "8d433cdd-4e8f-4dc1-aa24-8a4ddb7dc929",
"code": "SU",
"name": "Stanford University"
}
},
"permanentLocation": {
"id": "b0a1a8c3-cc9a-487c-a2ed-308fc3a49a91",
"code": "SUL-ELECTRONIC",
"name": "online resource",
"campus": {
"id": "c365047a-51f2-45ce-8601-e421ca3615c5",
"code": "SUL",
"name": "Stanford Libraries"
},
"details": {
},
"library": {
"id": "c1a86906-ced0-46cb-8f5b-8cef542bdd00",
"code": "SUL",
"name": "SUL"
},
"isActive": true,
"institution": {
"id": "8d433cdd-4e8f-4dc1-aa24-8a4ddb7dc929",
"code": "SU",
"name": "Stanford University"
}
}
}
}
],
"items": [
]
}
FOLIO JSON
{
"pieces": [
null
],
"instance": {
"id": "27260f83-8113-50f0-9a44-cb94d46ee4d4",
"hrid": "a14250490",
"notes": [
{
"note": "Part of: Synthesis digital library of engineering and computer science",
"staffOnly": false,
"instanceNoteTypeId": "6a2533a7-4de2-4e64-8466-074c2fa9308c"
},
{
"note": "Online resource; title from PDF title page (Morgan & Claypool, viewed on July 18, 2013)",
"staffOnly": false,
"instanceNoteTypeId": "66ea8f28-d5da-426a-a7c9-739a5d676347"
},
{
"note": "Includes bibliographical references (pages 113-127)",
"staffOnly": false,
"instanceNoteTypeId": "86b6e817-e1bc-42fb-bab0-70e7547de6c1"
},
{
"note": "1. Planning and autonomous behavior -- 1.1 Autonomous behavior: hardwired, learned, and model-based -- 1.2 Planning models and languages -- 1.3 Generality, complexity, and scalability -- 1.4 Examples -- 1.5 Generalized planning: plans vs. general strategies -- 1.6 History",
"staffOnly": false,
"instanceNoteTypeId": "5ba8e385-0e27-462e-a571-ffa1fa34ea54"
},
{
"note": "2. Classical planning: full information and deterministic actions -- 2.1 Classical planning model -- 2.2 Classical planning as path finding -- 2.3 Search algorithms: blind and heuristic -- 2.4 Online search: thinking and acting interleaved -- 2.5 Where do heuristics come from? -- 2.6 Languages for classical planning -- 2.7 Domain-independent heuristics and relaxations -- 2.8 Heuristic search planning -- 2.9 Decomposition and goal serialization -- 2.10 Structure, width, and complexity",
"staffOnly": false,
"instanceNoteTypeId": "5ba8e385-0e27-462e-a571-ffa1fa34ea54"
},
{
"note": "3. Classical planning: variations and extensions -- 3.1 Relaxed plans and helpful actions -- 3.2 Multi-queue best-first search -- 3.3 Implicit subgoals: landmarks -- 3.4 State-of-the-art classical planners -- 3.5 Optimal planning and admissible heuristics -- 3.6 Branching schemes and problem spaces -- 3.7 Regression planning -- 3.8 Planning as SAT and constraint satisfaction -- 3.9 Partial-order causal link planning -- 3.10 Cost, metric, and temporal planning -- 3.11 Hierarchical task networks",
"staffOnly": false,
"instanceNoteTypeId": "5ba8e385-0e27-462e-a571-ffa1fa34ea54"
},
{
"note": "4. Beyond classical planning: transformations -- 4.1 Soft goals and rewards -- 4.2 Incomplete information -- 4.3 Plan and goal recognition -- 4.4 Finite-state controllers -- 4.5 Temporally extended goals",
"staffOnly": false,
"instanceNoteTypeId": "5ba8e385-0e27-462e-a571-ffa1fa34ea54"
},
{
"note": "5. Planning with sensing: logical models -- 5.1 Model and language -- 5.2 Solutions and solution forms -- 5.3 Offline solution methods -- 5.4 Online solution methods -- 5.5 Belief tracking: width and complexity -- 5.6 Strong vs. strong cyclic solutions",
"staffOnly": false,
"instanceNoteTypeId": "5ba8e385-0e27-462e-a571-ffa1fa34ea54"
},
{
"note": "6. MDP planning: stochastic actions and full feedback -- 6.1 Goal, shortest-path, and discounted models -- 6.2 Dynamic programming algorithms -- 6.3 Heuristic search algorithms -- 6.4 Online MDP planning -- 6.5 Reinforcement learning, model-based RL, and planning",
"staffOnly": false,
"instanceNoteTypeId": "5ba8e385-0e27-462e-a571-ffa1fa34ea54"
},
{
"note": "7. POMDP planning: stochastic actions and partial feedback -- 7.1 Goal, shortest-path, and discounted POMDPs -- 7.2 Exact offline algorithms -- 7.3 Approximate and online algorithms -- 7.4 Belief tracking in POMDPs -- 7.5 Other MDP and POMDP solution methods",
"staffOnly": false,
"instanceNoteTypeId": "5ba8e385-0e27-462e-a571-ffa1fa34ea54"
},
{
"note": "8. Discussion -- 8.1 Challenges and open problems -- 8.2 Planning, scalability, and cognition",
"staffOnly": false,
"instanceNoteTypeId": "5ba8e385-0e27-462e-a571-ffa1fa34ea54"
},
{
"note": "Bibliography -- Author's biography",
"staffOnly": false,
"instanceNoteTypeId": "5ba8e385-0e27-462e-a571-ffa1fa34ea54"
},
{
"note": "Compendex",
"staffOnly": false,
"instanceNoteTypeId": "6ca9df3f-454d-4b5b-9d41-feb5d5030b99"
},
{
"note": "INSPEC",
"staffOnly": false,
"instanceNoteTypeId": "6ca9df3f-454d-4b5b-9d41-feb5d5030b99"
},
{
"note": "Google scholar",
"staffOnly": false,
"instanceNoteTypeId": "6ca9df3f-454d-4b5b-9d41-feb5d5030b99"
},
{
"note": "Google book search",
"staffOnly": false,
"instanceNoteTypeId": "6ca9df3f-454d-4b5b-9d41-feb5d5030b99"
},
{
"note": "Planning is the model-based approach to autonomous behavior where the agent behavior is derived automatically from a model of the actions, sensors, and goals. The main challenges in planning are computational as all models, whether featuring uncertainty and feedback or not, are intractable in the worst case when represented in compact form. In this book, we look at a variety of models used in AI planning, and at the methods that have been developed for solving them. The goal is to provide a modern and coherent view of planning that is precise, concise, and mostly self-contained, without being shallow. For this, we make no attempt at covering the whole variety of planning approaches, ideas, and applications, and focus on the essentials. The target audience of the book are students and researchers interested in autonomous behavior and planning from an AI, engineering, or cognitive science perspective",
"staffOnly": false,
"instanceNoteTypeId": "10e2e11b-450f-45c8-b09b-0f819999966e"
}
],
"title": "A concise introduction to models and methods for automated planning / Hector Geffner, Blai Bonet.",
"series": [
"Synthesis lectures on artificial intelligence and machine learning, 1939-4616 ; #22",
"Synthesis lectures on artificial intelligence and machine learning ; #22. 1939-4608"
],
"source": "MARC",
"_version": 1,
"editions": [
],
"metadata": {
"createdDate": "2023-08-21T21:22:27.688Z",
"updatedDate": "2023-08-21T21:22:27.688Z",
"createdByUserId": "58d0aaf6-dcda-4d5e-92da-012e6b7dd766",
"updatedByUserId": "58d0aaf6-dcda-4d5e-92da-012e6b7dd766"
},
"statusId": "9634a5ab-9228-4703-baf2-4d12ebc77d56",
"subjects": [
"Planning Automation",
"Planning Computer simulation",
"Artificial intelligence",
"Planification Automatisation",
"Planification Simulation par ordinateur",
"Intelligence artificielle",
"artificial intelligence",
"COMPUTERS Enterprise Applications Business Intelligence Tools",
"COMPUTERS Intelligence (AI) & Semantics"
],
"languages": [
"eng"
],
"indexTitle": "Concise introduction to models and methods for automated planning",
"identifiers": [
{
"value": "(Sirsi) a14250490",
"identifierTypeId": "7e591197-f335-4afb-bc6d-a6d76ca3bace"
},
{
"value": "9781608459704 (electronic bk.)",
"identifierTypeId": "8261054f-be78-422d-bd51-4ed9f33c3422"
},
{
"value": "1608459705 (electronic bk.)",
"identifierTypeId": "8261054f-be78-422d-bd51-4ed9f33c3422"
},
{
"value": "1608459691",
"identifierTypeId": "8261054f-be78-422d-bd51-4ed9f33c3422"
},
{
"value": "9781608459698",
"identifierTypeId": "8261054f-be78-422d-bd51-4ed9f33c3422"
},
{
"value": "9781608459698 (pbk.)",
"identifierTypeId": "fcca2643-406a-482a-b760-7a7f8aec640e"
},
{
"value": "9783031015649 (electronic bk.)",
"identifierTypeId": "8261054f-be78-422d-bd51-4ed9f33c3422"
},
{
"value": "3031015649 (electronic bk.)",
"identifierTypeId": "8261054f-be78-422d-bd51-4ed9f33c3422"
},
{
"value": "10.2200/S00513ED1V01Y201306AIM022 doi",
"identifierTypeId": "2e8b3b6c-0e7d-4e48-bca2-b0b23b376af5"
},
{
"value": "10.2200/S00513ED1V01Y201306AIM022",
"identifierTypeId": "ebfd00b6-61d3-4d87-a6d8-810c941176d5"
},
{
"value": "10.2200/S00513ED1V01Y201306AIM022",
"identifierTypeId": "1795ea23-6856-48a5-a772-f356e16a8a6c"
},
{
"value": "10.1007/978-3-031-01564-9 doi",
"identifierTypeId": "2e8b3b6c-0e7d-4e48-bca2-b0b23b376af5"
},
{
"value": "10.1007/978-3-031-01564-9",
"identifierTypeId": "ebfd00b6-61d3-4d87-a6d8-810c941176d5"
},
{
"value": "10.1007/978-3-031-01564-9",
"identifierTypeId": "1795ea23-6856-48a5-a772-f356e16a8a6c"
},
{
"value": "(OCoLC)853278184",
"identifierTypeId": "439bfbae-75bc-4f74-9fc7-b2a2d47ce3ef"
},
{
"value": "(OCoLC)851972580",
"identifierTypeId": "fc4e3f2a-887a-46e5-8057-aeeb271a4e56"
},
{
"value": "(OCoLC)863709979",
"identifierTypeId": "fc4e3f2a-887a-46e5-8057-aeeb271a4e56"
},
{
"value": "(OCoLC)961502988",
"identifierTypeId": "fc4e3f2a-887a-46e5-8057-aeeb271a4e56"
},
{
"value": "(OCoLC)962653996",
"identifierTypeId": "fc4e3f2a-887a-46e5-8057-aeeb271a4e56"
},
{
"value": "(Sirsi) spocn853278184",
"identifierTypeId": "7e591197-f335-4afb-bc6d-a6d76ca3bace"
}
],
"publication": [
{
"place": "Cham, Switzerland",
"publisher": "Springer",
"dateOfPublication": "©2013"
}
],
"contributors": [
{
"name": "Geffner, Hector",
"primary": true,
"contributorTypeId": "9f0a2cf0-7a9b-45a2-a403-f68d2850d07c",
"contributorNameTypeId": "2b94c631-fca9-4892-a730-03ee529ffe2a"
},
{
"name": "Bonet, Blai (Computer scientist)",
"primary": false,
"contributorTypeId": "9f0a2cf0-7a9b-45a2-a403-f68d2850d07c",
"contributorNameTypeId": "2b94c631-fca9-4892-a730-03ee529ffe2a"
}
],
"catalogedDate": "2022-07-02",
"staffSuppress": false,
"instanceTypeId": "6312d172-f0cf-40f6-b27d-9fa8feaf332f",
"previouslyHeld": false,
"classifications": [
{
"classificationNumber": "Q335 .G443 2013",
"classificationTypeId": "ce176ace-a53e-4b4d-aa89-725ed7b2edac"
},
{
"classificationNumber": "006.3",
"classificationTypeId": "42471af9-7d25-4f3a-bf78-60d29dcf463b"
}
],
"instanceFormats": [
],
"electronicAccess": [
{
"uri": "https://link.springer.com/10.1007/978-3-031-01564-9",
"name": "Resource",
"linkText": "SpringerLink",
"publicNote": "Available to Stanford-affiliated users",
"relationshipId": "f5d0068e-6272-458e-8a81-b85e7b9a14aa"
}
],
"holdingsRecords2": [
],
"modeOfIssuanceId": "9d18a02f-5897-4c31-9106-c9abb5c7ae8b",
"publicationRange": [
],
"statisticalCodes": [
],
"alternativeTitles": [
],
"discoverySuppress": false,
"instanceFormatIds": [
"f5e8210f-7640-459b-a71f-552567f92369"
],
"publicationPeriod": {
"start": 2013
},
"statusUpdatedDate": "2023-08-21T21:22:26.994+0000",
"statisticalCodeIds": [
],
"administrativeNotes": [
],
"physicalDescriptions": [
"1 online resource (xii, 129 pages) : illustrations"
],
"publicationFrequency": [
],
"suppressFromDiscovery": false,
"natureOfContentTermIds": [
]
},
"holdingSummaries": [
{
"poLineId": null,
"orderType": null,
"orderStatus": null,
"poLineNumber": null,
"orderSentDate": null,
"orderCloseReason": null,
"polReceiptStatus": null
}
]
}
