Sciweavers

265 search results - page 49 / 53
» Inductive Situation Calculus
Sort
View
AIPS
2009
13 years 8 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
ATAL
2010
Springer
13 years 8 months ago
Agreeing on plans through iterated disputes
Autonomous agents transcend their individual capabilities by cooperating towards achieving shared goals. The different viewpoints agents have on the environment cause disagreement...
Alexandros Belesiotis, Michael Rovatsos, Iyad Rahw...
RAS
2008
150views more  RAS 2008»
13 years 7 months ago
Logic-based robot control in highly dynamic domains
In this paper we present the robot programming and planning language Readylog, a Golog dialect which was developed to support the decision making of robots acting in dynamic real-...
Alexander Ferrein, Gerhard Lakemeyer
ICFP
2009
ACM
14 years 8 months ago
Causal commutative arrows and their optimization
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
Hai Liu, Eric Cheng, Paul Hudak
EWSA
2005
Springer
14 years 1 months ago
Architecture Description for Mobile Distributed Systems
Abstract. In this paper we motivate an Architecture Description Language (ADL) for mobile distributed systems based on the π-calculus. Different from other approaches, the non-fu...
Volker Gruhn, Clemens Schäfer