Sciweavers

622 search results - page 33 / 125
» Solving the Robots Gathering Problem
Sort
View
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
13 years 6 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...
ICML
2009
IEEE
14 years 8 months ago
Robot trajectory optimization using approximate inference
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
Marc Toussaint
FSKD
2005
Springer
128views Fuzzy Logic» more  FSKD 2005»
14 years 1 months ago
Automatic Creation of Links: An Approach Based on Decision Tree
With the dramatic development of web technologies, tremendous amount of information become available to users. The great advantages of the web are the ease with which information c...
Peng Li, Seiji Yamada
JISE
2008
143views more  JISE 2008»
13 years 7 months ago
A Geometry-Based Secret Image Sharing Approach
This paper solves the visual cryptography problem by the Blakley scheme that is a geometry-based secret sharing strategy. We first partition the protected image into non-overlappi...
Chien-Chang Chen, Wen-Yin Fu
ROBVIS
2001
Springer
114views Robotics» more  ROBVIS 2001»
14 years 7 days ago
A Wavelet-Based Algorithm for Height from Gradients
This paper presents a wavelet-based algorithm for height from gradients. The tensor product of the third-order Daubechies’ scaling functions is used to span the solution space. ...
Tiangong Wei, Reinhard Klette