ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    facet.materialart.
    Unknown
    Generalizing Backtrack-Free Search: A Framework for Search-Free Constraint Satisfaction (2000)
    In:  Other Sources
    Details
    Publication Date: 2011-08-23
    Description: Tractable classes of constraint satisfaction problems are of great importance in artificial intelligence. Identifying and taking advantage of such classes can significantly speed up constraint problem solving. In addition, tractable classes are utilized in applications where strict worst-case performance guarantees are required, such as constraint-based plan execution. In this work, we present a formal framework for search-free (backtrack-free) constraint satisfaction. The framework is based on general procedures, rather than specific propagation techniques, and thus generalizes existing techniques in this area. We also relate search-free problem solving to the notion of decision sets and use the result to provide a constructive criterion that is sufficient to guarantee search-free problem solving.
    Keywords: Cybernetics, Artificial Intelligence and Robotics
    Format: text
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 2
    facet.materialart.
    Unknown
    Bridging the Gap Between Planning and Scheduling (2000)
    In:  CASI
    Details
    Publication Date: 2013-08-29
    Description: Planning research in Artificial Intelligence (AI) has often focused on problems where there are cascading levels of action choice and complex interactions between actions. In contrast. Scheduling research has focused on much larger problems where there is little action choice, but the resulting ordering problem is hard. In this paper, we give an overview of M planning and scheduling techniques, focusing on their similarities, differences, and limitations. We also argue that many difficult practical problems lie somewhere between planning and scheduling, and that neither area has the right set of tools for solving these vexing problems.
    Keywords: Cybernetics, Artificial Intelligence and Robotics
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 3
    facet.materialart.
    Unknown
    On Reformulating Planning as Dynamic Constraint Satisfaction (2000)
    In:  CASI
    Details
    Publication Date: 2013-08-29
    Description: In recent years, researchers have reformulated STRIPS planning problems as SAT problems or CSPs. In this paper, we discuss the Constraint-Based Interval Planning (CBIP) paradigm, which can represent planning problems incorporating interval time and resources. We describe how to reformulate mutual exclusion constraints for a CBIP-based system, the Extendible Uniform Remote Operations Planner Architecture (EUROPA). We show that reformulations involving dynamic variable domains restrict the algorithms which can be used to solve the resulting DCSP. We present an alternative formulation which does not employ dynamic domains, and describe the relative merits of the different reformulations.
    Keywords: Administration and Management
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 4
    facet.materialart.
    Unknown
    Mixed-Initiative Constraint-Based Activity Planning for Mars Exploration Rovers (2004)
    In:  CASI
    Details
    Publication Date: 2019-07-13
    Description: In January, 2004, two NASA rovers, named Spirit and Opportunity, successfully landed on Mars, starting an unprecedented exploration of the Martian surface. Power and thermal concerns constrained the duration of this mission, leading to an aggressive plan for commanding both rovers every day. As part of the process for generating these command loads, the MAPGEN tool provides engineers and scientists an intelligent activity planning tool that allows them to more effectively generate complex plans that maximize the science return each day. The key to'the effectiveness of the MAPGEN tool is an underlying artificial intelligence plan and constraint reasoning engine. In this paper we outline the design and functionality of the MAEPGEN tool and focus on some of the key capabilities it offers to the MER mission engineers.
    Keywords: Lunar and Planetary Science and Exploration
    Type: 4th International Workshop on Planning and Scheduling for Space; Jun 23, 2004 - Jun 25, 2004; Darmstadt; Germany
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 5
    facet.materialart.
    Unknown
    A Framework for Dynamic Constraint Reasoning Using Procedural Constraints (1999)
    In:  CASI
    Details
    Publication Date: 2019-07-13
    Description: Many complex real-world decision and control problems contain an underlying constraint reasoning problem. This is particularly evident in a recently developed approach to planning, where almost all planning decisions are represented by constrained variables. This translates a significant part of the planning problem into a constraint network whose consistency determines the validity of the plan candidate. Since higher-level choices about control actions can add or remove variables and constraints, the underlying constraint network is invariably highly dynamic. Arbitrary domain-dependent constraints may be added to the constraint network and the constraint reasoning mechanism must be able to handle such constraints effectively. Additionally, real problems often require handling constraints over continuous variables. These requirements present a number of significant challenges for a constraint reasoning mechanism. In this paper, we introduce a general framework for handling dynamic constraint networks with real-valued variables, by using procedures to represent and effectively reason about general constraints. The framework is based on a sound theoretical foundation, and can be proven to be sound and complete under well-defined conditions. Furthermore, the framework provides hybrid reasoning capabilities, as alternative solution methods like mathematical programming can be incorporated into the framework, in the form of procedures.
    Keywords: Cybernetics, Artificial Intelligence and Robotics
    Type: Aug 01, 2000; Unknown
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 6
    facet.materialart.
    Unknown
    The Logic of Reachability (2001)
    In:  CASI
    Details
    Publication Date: 2019-07-13
    Description: In recent years, Graphplan style reachability analysis and mutual exclusion reasoning have been used in many high performance planning systems. While numerous refinements and extensions have been developed, the basic plan graph structure and reasoning mechanisms used in these systems are tied to the very simple STRIPS model of action. In 1999, Smith and Weld generalized the Graphplan methods for reachability and mutex reasoning to allow actions to have differing durations. However, the representation of actions still has some severe limitations that prevent the use of these techniques for many real-world planning systems. In this paper, we 1) separate the logic of reachability from the particular representation and inference methods used in Graphplan, and 2) extend the notions of reachability and mutual exclusion to more general notions of time and action. As it turns out, the general rules for mutual exclusion reasoning take on a remarkably clean and simple form. However, practical instantiations of them turn out to be messy, and require that we make representation and reasoning choices.
    Keywords: Systems Analysis and Operations Research
    Type: Sixth International Conference on Artificial Intelligence Planning and Scheduling; Apr 23, 2002 - Apr 27, 2002; Toulouse; France
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 7
    facet.materialart.
    Unknown
    Scoping Planning Agents With Shared Models (2003)
    In:  CASI
    Details
    Publication Date: 2019-07-13
    Description: In this paper we provide a formal framework to define the scope of planning agents based on a single declarative model. Having multiple agents sharing a single model provides numerous advantages that lead to reduced development costs and increase reliability of the system. We formally define planning in terms of extensions of an initial partial plan, and a set of flaws that make the plan unacceptable. A Flaw Filter (FF) allows us to identify those flaws relevant to an agent. Flaw filters motivate the Plan Identification Function (PIF), which specifies when an agent is is ready hand control to another agent for further work. PIFs define a set of plan extensions that can be generated from a model and a plan request. FFs and PIFs can be used to define the scope of agents without changing the model. We describe an implementation of PIFsand FFswithin the context of EUROPA, a constraint-based planning architecture, and show how it can be used to easily design many different agents.
    Keywords: Cybernetics, Artificial Intelligence and Robotics
    Type: 14th International Conference on Automated Planning and Scheduling; Jun 01, 2003; Canada
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 8
    facet.materialart.
    Unknown
    MAPGEN Planner: Mixed-Initiative Activity Planning for the Mars Exploration Rover Mission (2003)
    In:  CASI
    Details
    Publication Date: 2019-07-13
    Description: This document describes the Mixed-initiative Activity Plan Generation system MAPGEN. The system is be- ing developed as one of the tools to be used during surface operations of NASA's Mars Exploration Rover mission (MER). However, the core technology is general and can be adapted to different missions and applications. The motivation for the system is to better support users that need to rapidly build activity plans that have to satisfy complex rules and fit within resource limits. The system therefore combines an existing tool for activity plan editing and resource modeling, with an advanced constraint-based reasoning and planning framework. The demonstration will show the key capabilities of the automated reasoning and planning component of the system, with emphasis on how these capabilities will be used during surface operations of the MER mission.
    Keywords: Lunar and Planetary Science and Exploration
    Type: 13th International Conference on Automated Planning and Scheduling; Jun 09, 2003 - Jun 13, 2003; Trento; Italy
    Format: text
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 9
    facet.materialart.
    Unknown
    Mixed-Initiative Planning in MAPGEN: Capabilities and Shortcomings (2005)
    In:  CASI
    Details
    Publication Date: 2019-07-13
    Description: MAPGEN (Mixed-initiative Activity Plan GENerator) is a mixed-initiative system that employs automated constraint-based planning, scheduling, and temporal reasoning to assist the Mars Exploration Rover mission operations staff in generating the daily activity plans. This paper describes the mixed-initiative capabilities of MAPGEN, identifies shortcomings with the deployed system, and discusses ongoing work to address some of these shortcomings.
    Keywords: Lunar and Planetary Science and Exploration
    Type: Workshop on Mixed-Initiative Planning and Scheduling; Jun 01, 2005; Monterey, CA; United States
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 10
    facet.materialart.
    Unknown
    Activity Planning for the Mars Exploration Rovers (2004)
    In:  CASI
    Details
    Publication Date: 2019-07-13
    Description: Operating the Mars Exploration Rovers is a challenging, time-pressured task. Each day, the operations team must generate a new plan describing the rover activities for the next day. These plans must abide by resource limitations, safety rules, and temporal constraints. The objective is to achieve as much science as possible, choosing from a set of observation requests that oversubscribe rover resources. In order to accomplish this objective, given the short amount of planning time available, the MAPGEN (Mixed-initiative Activity Plan GENerator) system was made a mission-critical part of the ground operations system. MAPGEN is a mixed-initiative system that employs automated constraint-based planning, scheduling, and temporal reasoning to assist operations staff in generating the daily activity plans. This paper describes the adaptation of constraint-based planning and temporal reasoning to a mixed-initiative setting and the key technical solutions developed for the mission deployment of MAPGEN.
    Keywords: Cybernetics, Artificial Intelligence and Robotics
    Type: ICAPS-2005 Conference; Jun 05, 2005 - Jun 10, 2005; Monterey, CA; United States
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...