Sciweavers

220 search results - page 21 / 44
» Path planning using learned constraints and preferences
Sort
View
AGENTS
1998
Springer
15 years 1 months ago
Learning Situation-Dependent Costs: Improving Planning from Probabilistic Robot Execution
Physical domains are notoriously hard to model completely and correctly, especially to capture the dynamics of the environment. Moreover, since environments change, it is even mor...
Karen Zita Haigh, Manuela M. Veloso
79
Voted
IJAOSE
2010
227views more  IJAOSE 2010»
14 years 8 months ago
Implementing reactive BDI agents with user-given constraints and objectives
CASO is an agent-oriented programming language based on AgentSpeak(L), one of the most influential abstract languages based on the BDI (Beliefs-Desires-Intentions) architecture. ...
Aniruddha Dasgupta, Aditya K. Ghose
AROBOTS
2011
14 years 4 months ago
Time-extended multi-robot coordination for domains with intra-path constraints
Abstract— Many applications require teams of robots to cooperatively execute complex tasks. Among these domains are those where successful coordination solutions must respect con...
Edward Gil Jones, M. Bernardine Dias, Anthony Sten...
ICWS
2008
IEEE
14 years 11 months ago
A Framework for the Semantic Composition of Web Services Handling User Constraints
In this work, we present a framework for the semantic composition of web services based on Statecharts and uniform community service descriptions. Our model is a two step process....
Youssef Gamha, Nacéra Bennacer, Guy Vidal-N...
IFM
2009
Springer
124views Formal Methods» more  IFM 2009»
15 years 4 months ago
Dynamic Path Reduction for Software Model Checking
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
Zijiang Yang, Bashar Al-Rawi, Karem Sakallah, Xiao...