Sciweavers

93 search results - page 5 / 19
» Introducing Preferences in Planning as Satisfiability
Sort
View
AI
2007
Springer
13 years 7 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne
GROUP
2005
ACM
14 years 1 months ago
Adaptive radio: achieving consensus using negative preferences
We introduce the use of negative preferences to produce solutions that are acceptable to a group of users. Using negative preference profiling, a system determines which solution...
Dennis L. Chao, Justin Balthrop, Stephanie Forrest
FLAIRS
2006
13 years 9 months ago
CATS: A Synchronous Approach to Collaborative Group Recommendation
Group recommender systems introduce a whole set of new challenges for recommender systems research. The notion of generating a set of recommendations that will satisfy a group of ...
Kevin McCarthy, Maria Salamó, Lorcan Coyle,...
ICRA
2007
IEEE
132views Robotics» more  ICRA 2007»
14 years 1 months ago
Smooth Feedback for Car-Like Vehicles in Polygonal Environments
— We introduce a method for constructing provably safe smooth feedback laws for car-like robots in obstaclecluttered polygonal environments. The robot is taken to be a point with...
Stephen R. Lindemann, Steven M. LaValle
ECAI
2008
Springer
13 years 9 months ago
Learning in Planning with Temporally Extended Goals and Uncontrollable Events
Recent contributions to advancing planning from the classical model to more realistic problems include using temporal logic such as LTL to express desired properties of a solution ...
André A. Ciré, Adi Botea