Sciweavers

408 search results - page 30 / 82
» A lookahead strategy for solving large planning problems
Sort
View
IAT
2009
IEEE
15 years 28 days ago
Developing a Deterministic Patrolling Strategy for Security Agents
Abstract—Developing autonomous systems that patrol environments for detecting intruders is a topic of increasing relevance in security applications. An important aspect of these ...
Nicola Basilico, Nicola Gatti, Francesco Amigoni
ICDAR
2005
IEEE
15 years 3 months ago
Recognition for Large Sets of Handwritten Mathematical Symbols
Natural and convenient mathematical handwriting recognition requires recognizers for large sets of handwritten symbols. This paper presents a recognition system for such handwritt...
Stephen M. Watt, Xiaofang Xie
65
Voted
IJBC
2007
72views more  IJBC 2007»
14 years 9 months ago
Centrality Estimation in Large Networks
Centrality indices are an essential concept in network analysis. For those based on shortest-path distances the computation is at least quadratic in the number of nodes, since it ...
Ulrik Brandes, Christian Pich
72
Voted
ATAL
2010
Springer
14 years 10 months ago
Incremental plan aggregation for generating policies in MDPs
Despite the recent advances in planning with MDPs, the problem of generating good policies is still hard. This paper describes a way to generate policies in MDPs by (1) determiniz...
Florent Teichteil-Königsbuch, Ugur Kuter, Gui...
ATAL
2009
Springer
14 years 10 months ago
Efficient physics-based planning: sampling search via non-deterministic tactics and skills
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
Stefan Zickler, Manuela M. Veloso