Sciweavers

864 search results - page 71 / 173
» Plan Generation and Plan Execution in Agent Programming
Sort
View
NIPS
2001
13 years 9 months ago
Multiagent Planning with Factored MDPs
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
Carlos Guestrin, Daphne Koller, Ronald Parr
IFIP
2010
Springer
13 years 2 months ago
Modular Plans for Secure Service Composition
Service Oriented Computing (SOC) is a programming paradigm aiming at characterising Service Networks. Services are entities waiting for clients requests and they often result from ...
Gabriele Costa, Pierpaolo Degano, Fabio Martinelli
IROS
2009
IEEE
192views Robotics» more  IROS 2009»
14 years 2 months ago
Kinodynamic motion planning for mobile robots using splines
— This paper presents an approach to time-optimal kinodynamic motion planning for a mobile robot. A global path planner is used to generate collision-free straight-line paths fro...
Boris Lau, Christoph Sprunk, Wolfram Burgard
AAAI
1998
13 years 9 months ago
Using Caching to Solve Larger Probabilistic Planning Problems
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
Stephen M. Majercik, Michael L. Littman
IAT
2007
IEEE
14 years 2 months ago
Privacy Loss in Classical Multiagent Planning
Privacy is often cited as the main reason to adopt a multiagent approach for a certain problem. This also holds true for multiagent planning. Still, papers on multiagent planning ...
Roman van der Krogt