000 03538nam a22005535i 4500
001 978-3-540-44657-6
003 DE-He213
005 20160624101950.0
007 cr nn 008mamaa
008 121227s2000 gw | s |||| 0|eng d
020 _a9783540446576
_9978-3-540-44657-6
024 7 _a10.1007/10720246
_2doi
050 4 _aQ334-342
050 4 _aTJ210.2-211.495
072 7 _aUYQ
_2bicssc
072 7 _aTJFM1
_2bicssc
072 7 _aCOM004000
_2bisacsh
082 0 4 _a006.3
_223
245 1 0 _aRecent Advances in AI Planning
_h[electronic resource] :
_b5th European Conference on Planning, ECP’99, Durham, UK, September 8-10, 1999. Proceedings /
_cedited by Susanne Biundo, Maria Fox.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2000.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2000.
300 _aVIII, 380 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1809
505 0 _aPlanning as Model Checking -- Conformant Planning via Model Checking -- Strong Cyclic Planning Revisited -- Scaleability in Planning -- Exploiting Competitive Planner Performance -- A Parallel Algorithm for POMDP Solution -- Plan Merging & Plan Reuse as Satisfiability -- SAT-Based Procedures for Temporal Reasoning -- Numeric State Variables in Constraint-Based Planning -- Hierarchical Task Network Planning as Satisfiability -- Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length -- Action Constraints for Planning -- Least Commitment on Variable Binding in Presence of Incomplete Knowledge -- Scaling up Planning by Teasing Out Resource Scheduling -- Real-Time Scheduling for Multi-agent Call Center Automation -- Task Decomposition Support to Reactive Scheduling -- Greedy Algorithms for the Multi-capacitated Metric Scheduling Problem -- Automata-Theoretic Approach to Planning for Temporally Extended Goals -- Integer Programs and Valid Inequalities for Planning Problems -- Deductive Synthesis of Recursive Plans in Linear Logic -- Sensor Planning with Non-linear Utility Functions -- Propice-Plan: Toward a Unified Framework for Planning and Execution -- What is the Expressive Power of Disjunctive Preconditions? -- Some Results on the Complexity of Planning with Incomplete Information -- Probabilistic Planning in the Graphplan Framework -- Making Graphplan Goal-Directed -- GRT: A Domain Independent Heuristic for STRIPS Worlds Based on Greedy Regression Tables -- Planning as Heuristic Search: New Results.
650 0 _aComputer science.
650 0 _aComputer software.
650 0 _aElectronic data processing.
650 0 _aComputational complexity.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aNumeric Computing.
650 2 4 _aDiscrete Mathematics in Computer Science.
700 1 _aBiundo, Susanne.
_eeditor.
700 1 _aFox, Maria.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540678663
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1809
856 4 0 _uhttp://dx.doi.org/10.1007/10720246
942 _2EBK4941
_cEBK
999 _c34235
_d34235