Sciweavers

455 search results - page 21 / 91
» Dynamic well-spaced point sets
Sort
View
ICRA
2007
IEEE
144views Robotics» more  ICRA 2007»
15 years 4 months ago
Improved Data Association for ICP-based Scan Matching in Noisy and Dynamic Environments
— This paper presents a technique to improve the data association in the Iterative Closest Point [2] based scan matching. The method is based on a distance-filter constructed on...
Diego Rodríguez-Losada, Javier Minguez
IJCAI
2007
14 years 11 months ago
Memory-Bounded Dynamic Programming for DEC-POMDPs
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...
Sven Seuken, Shlomo Zilberstein
AUTOMATICA
2004
113views more  AUTOMATICA 2004»
14 years 9 months ago
Ellipsoidal bounds for uncertain linear equations and dynamical systems
In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids that bound the solution set of a system of uncertain linear equations. The propo...
Giuseppe Carlo Calafiore, Laurent El Ghaoui
COMGEO
2012
ACM
13 years 5 months ago
Point-set embeddings of plane 3-trees
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
Rahnuma Islam Nishat, Debajyoti Mondal, Md. Saidur...
WADS
1997
Springer
108views Algorithms» more  WADS 1997»
15 years 2 months ago
Dynamic Data Structures for Fat Objects and Their Applications
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha ...