Sciweavers

536 search results - page 44 / 108
» Planning by Abstraction Using HW[]
Sort
View
IJRR
2010
114views more  IJRR 2010»
13 years 6 months ago
Generating Uniform Incremental Grids on SO(3) Using the Hopf Fibration
Abstract The problem of generating uniform deterministic samples over the rotation group, SO(3), is fundamental to many fields, such as computational structural biology, robotics,...
Anna Yershova, Swati Jain, Steven M. LaValle, Juli...
IJIS
2002
112views more  IJIS 2002»
13 years 7 months ago
Integrating fuzzy topological maps and fuzzy geometric maps for behavior-based robots
ior-based robots, planning is necessary to elaborate abstract plans that resolve complex navigational tasks. Usually maps of the environment are used to plan the robot motion and t...
Eugenio Aguirre, Antonio González
ATAL
1999
Springer
14 years 8 hour ago
Incorporating Uncertainty in Agent Commitments
Abstract. Commitments play a central role in multi-agent coordination. However, they are inherently uncertain and it is important to take these uncertainties into account during pl...
Ping Xuan, Victor R. Lesser
ALENEX
2001
101views Algorithms» more  ALENEX 2001»
13 years 9 months ago
CNOP - A Package for Constrained Network Optimization
Abstract. We present a generic package for resource constrained network optimization problems. We illustrate the flexibility and the use of our package by solving four applications...
Kurt Mehlhorn, Mark Ziegelmann
ICMLA
2009
13 years 5 months ago
Automatic Feature Selection for Model-Based Reinforcement Learning in Factored MDPs
Abstract--Feature selection is an important challenge in machine learning. Unfortunately, most methods for automating feature selection are designed for supervised learning tasks a...
Mark Kroon, Shimon Whiteson