Sciweavers

331 search results - page 36 / 67
» Robot trajectory optimization using approximate inference
Sort
View
JCB
2007
92views more  JCB 2007»
13 years 7 months ago
Neighbor Joining Algorithms for Inferring Phylogenies via LCA Distances
Reconstructing phylogenetic trees efficiently and accurately from distance estimates is an ongoing challenge in computational biology from both practical and theoretical consider...
Ilan Gronau, Shlomo Moran
ATAL
2004
Springer
14 years 1 months ago
Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
ML
1998
ACM
153views Machine Learning» more  ML 1998»
13 years 7 months ago
Bayesian Landmark Learning for Mobile Robot Localization
To operate successfully in indoor environments, mobile robots must be able to localize themselves. Most current localization algorithms lack flexibility, autonomy, and often optim...
Sebastian Thrun
IROS
2007
IEEE
136views Robotics» more  IROS 2007»
14 years 1 months ago
A bounded uncertainty approach to cooperative localization using relative bearing constraints
— This paper describes an approach to cooperative localization which finds its roots in robust estimation, employing an unknown-but-bounded error model for sensor measurements. ...
Camillo J. Taylor, John R. Spletzer
ICANNGA
2007
Springer
133views Algorithms» more  ICANNGA 2007»
14 years 1 months ago
Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
Bo Yuan, Maria E. Orlowska, Shazia Wasim Sadiq