Sciweavers

297 search results - page 32 / 60
» Planning Partially for Situated Agents
Sort
View
AAAI
1990
13 years 10 months ago
Anytime Synthetic Projection: Maximizing the Probability of Goal Satisfaction
This paper presents a projection algorithm for incremental control rule synthesis. The algorithm synthesizes an initial set of goal-achieving control rules using a combination of ...
Mark Drummond, John L. Bresina
AAAI
2000
13 years 10 months ago
From Causal Theories to Successor State Axioms and STRIPS-Like Systems
We describe a system for specifying the effects of actions. Unlike those commonly used in AI planning, our system uses an action description language that allows one to specify th...
Fangzhen Lin
MAS
1998
Springer
152views Communications» more  MAS 1998»
14 years 1 months ago
D'Agents: Security in a Multiple-Language, Mobile-Agent System
Abstract. Mobile-agent systems must address three security issues: protecting an individual machine, protecting a group of machines, and protecting an agent. In this chapter, we di...
Robert S. Gray, David Kotz, George Cybenko, Daniel...
LOGCOM
1998
178views more  LOGCOM 1998»
13 years 8 months ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Munindar P. Singh
CP
1997
Springer
14 years 1 months ago
Distributed Partial Constraint Satisfaction Problem
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
Katsutoshi Hirayama, Makoto Yokoo