Sciweavers

    226 search results - page 2 / 46
    » Heuristic Search Planning with BDDs
    Sort
    View
    IJCAI
    2003
    173views Artificial Intelligence» more  IJCAI 2003»
    On the application of least-commitment and heuristic search in temporal planning
    13 years 6 months ago
    On the application of least-commitment and heuristic search in temporal planning
    Download  dli.iiit.ac.in
    Graphplan planning graphs are structures widely used in modern planners. The exclusion relations calculated in the planning graph extension provide very useful information, especi...
    Antonio Garrido Tejero, Eva Onaindia
    claim paper
    Read More »
    IJCAI
    2007
    179views Artificial Intelligence» more  IJCAI 2007»
    A Heuristic Search Approach to Planning with Temporally Extended Preferences
    13 years 6 months ago
    A Heuristic Search Approach to Planning with Temporally Extended Preferences
    Download  www.ijcai.org
    In this paper we propose a suite of techniques for planning with temporally extended preferences (TEPs). To this end, we propose a method for compiling TEP planning problems into ...
    Jorge A. Baier, Fahiem Bacchus, Sheila A. McIlrait...
    claim paper
    Read More »
    AAAI
    2006
    136views Intelligent Agents» more  AAAI 2006»
    Controlled Search over Compact State Representations, in Nondeterministic Planning Domains and Beyond
    13 years 6 months ago
    Controlled Search over Compact State Representations, in Nondeterministic Planning Domains and Beyond
    Download  www.cs.umd.edu
    Two of the most efficient planners for planning in nondeterministic domains are MBP and ND-SHOP2. MBP achieves its efficiency by using Binary Decision Diagrams (BDDs) to represent...
    Ugur Kuter, Dana S. Nau
    claim paper
    Read More »
    JAIR
    2012
    205views Hardware» more  JAIR 2012»
    COLIN: Planning with Continuous Linear Numeric Change
    11 years 7 months ago
    COLIN: Planning with Continuous Linear Numeric Change
    Download  www.jair.org
    In this paper we describe COLIN, a forward-chaining heuristic search planner, capable of reasoning with COntinuous LINear numeric change, in addition to the full temporal semantic...
    Amanda Jane Coles, Andrew Coles, Maria Fox, Derek ...
    claim paper
    Read More »
    IJCAI
    2001
    95views Artificial Intelligence» more  IJCAI 2001»
    Local Search Topology in Planning Benchmarks: An Empirical Analysis
    13 years 6 months ago
    Local Search Topology in Planning Benchmarks: An Empirical Analysis
    Download  www.informatik.uni-freiburg.de
    Many state-of-the-art heuristic planners derive their heuristic function by relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. ...
    Jörg Hoffmann
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.