Sciweavers

842 search results - page 47 / 169
» Search Control Techniques for Planning
Sort
View
ICCBR
1999
Springer
14 years 1 months ago
Is CBR Applicable to the Coordination of Search and Rescue Operations? A Feasibility Study
In response to the occurrence of an air incident, controllers at one of the three Canadian Rescue Coordination Centers (RCC) must make a series of critical decisions on the appropr...
Irène Abi-Zeid, Qiang Yang, Luc Lamontagne
CP
2008
Springer
13 years 10 months ago
Guiding Search in QCSP+ with Back-Propagation
The Quantified Constraint Satisfaction Problem (QCSP) has been introduced to express situations in which we are not able to control the value of some of the variables (the universa...
Guillaume Verger, Christian Bessiere
AIPS
2009
13 years 10 months ago
Dynamic Controllability of Temporally-flexible Reactive Programs
In this paper we extend dynamic controllability of temporally-flexible plans to temporally-flexible reactive programs. We consider three reactive programming language constructs w...
Robert T. Effinger, Brian C. Williams, Gerard Kell...
AIPS
2009
13 years 10 months ago
Inference and Decomposition in Planning Using Causal Consistent Chains
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
Nir Lipovetzky, Hector Geffner
CASCON
1996
72views Education» more  CASCON 1996»
13 years 10 months ago
A robot agent that can search
Object search is the task of eciently searching for a given 3D object in a given 3D environment by an agent equipped with a camera for target detection and, if the environment con...
Yiming Ye, John K. Tsotsos