Sciweavers

4212 search results - page 730 / 843
» On Compressible Pairings and Their Computation
Sort
View
ICRA
2010
IEEE
90views Robotics» more  ICRA 2010»
15 years 5 months ago
Robust robotic assembly through contingencies, plan repair and re-planning
Abstract— Enabling mobile robots to assemble large structures in constrained environments requires planning systems that are both capable of dealing with high complexity and can ...
Frederik W. Heger, Sanjiv Singh
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
15 years 5 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...
ICRA
2010
IEEE
164views Robotics» more  ICRA 2010»
15 years 5 months ago
Boundary detection based on supervised learning
— Detecting the boundaries of objects is a key step in separating foreground objects from the background, which is useful for robotics and computer vision applications, such as o...
Kiho Kwak, Daniel F. Huber, Jeongsook Chae, Takeo ...
JELIA
2010
Springer
15 years 4 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
PAMI
2010
200views more  PAMI 2010»
15 years 4 months ago
Learning Context-Sensitive Shape Similarity by Graph Transduction
—Shape similarity and shape retrieval are very important topics in computer vision. The recent progress in this domain has been mostly driven by designing smart shape descriptors...
Xiang Bai, Xingwei Yang, Longin Jan Latecki, Wenyu...