Sciweavers

6693 search results - page 38 / 1339
» On an anytime algorithm for control
Sort
View
AIPS
2003
13 years 10 months ago
A Framework for Planning in Continuous-time Stochastic Domains
We propose a framework for policy generation in continuoustime stochastic domains with concurrent actions and events of uncertain duration. We make no assumptions regarding the co...
Håkan L. S. Younes, David J. Musliner, Reid ...
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 9 months ago
Locating phase transitions in computationally hard problems
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
B. Ashok, T. K. Patra
JAIR
2006
89views more  JAIR 2006»
13 years 9 months ago
Distributed Reasoning in a Peer-to-Peer Setting: Application to the Semantic Web
In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we ...
Philippe Adjiman, Philippe Chatalic, Franço...
CEC
2010
IEEE
13 years 23 days ago
Co-evolutionary search path planning under constrained information-sharing for a cooperative unmanned aerial vehicle team
—Mobile cooperative sensor networks are increasingly used for surveillance and reconnaissance tasks to support domain picture compilation. However, efficient distributed informat...
Jean Berger, Jens Happe
CDC
2009
IEEE
151views Control Systems» more  CDC 2009»
14 years 1 months ago
An algorithm for event-based optimal feedback control
— We present an algorithm for an event based approach to the global optimal control of nonlinear systems with coarsely quantized state measurement. The quantized measurements ind...
Lars Grüne, Florian Mueller