Sciweavers

238 search results - page 24 / 48
» Planning as Satisfiability
Sort
View
IROS
2009
IEEE
137views Robotics» more  IROS 2009»
14 years 5 months ago
A framework for planning comfortable and customizable motion of an assistive mobile robot
Abstract— Assistive mobile robots that can navigate autonomously can greatly benefit people with mobility impairments. Since an assistive mobile robot transports a human user fr...
Shilpa Gulati, Chetan Jhurani, Benjamin Kuipers, R...
ICDCS
2010
IEEE
14 years 2 months ago
New Algorithms for Planning Bulk Transfer via Internet and Shipping Networks
—Cloud computing is enabling groups of academic collaborators, groups of business partners, etc., to come together in an ad-hoc manner. This paper focuses on the group-based data...
Brian Cho, Indranil Gupta
ECAI
2006
Springer
14 years 27 days ago
Solving Optimization Problems with DLL
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
Enrico Giunchiglia, Marco Maratea
ATAL
2009
Springer
14 years 5 months ago
Lossless clustering of histories in decentralized POMDPs
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
Frans A. Oliehoek, Shimon Whiteson, Matthijs T. J....
FSR
2007
Springer
135views Robotics» more  FSR 2007»
14 years 5 months ago
State Space Sampling of Feasible Motions for High Performance Mobile Robot Navigation in Highly Constrained Environments
Sampling in the space of controls or actions is a well-established method for ensuring feasible local motion plans. However, as mobile robots advance in performance and competence ...
Thomas M. Howard, Colin J. Green, Alonzo Kelly