Sciweavers

152 search results - page 7 / 31
» Computational scenario-based capability planning
Sort
View
86
Voted
IJRR
2010
132views more  IJRR 2010»
14 years 9 months ago
LQR-trees: Feedback Motion Planning via Sums-of-Squares Verification
Advances in the direct computation of Lyapunov functions using convex optimization make it possible to efficiently evaluate regions of attraction for smooth nonlinear systems. Her...
Russ Tedrake, Ian R. Manchester, Mark Tobenkin, Jo...
114
Voted
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
15 years 4 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick
ICDCS
2012
IEEE
13 years 2 months ago
eTransform: Transforming Enterprise Data Centers by Automated Consolidation
Abstract—Modern day enterprises have a large IT infrastructure comprising thousands of applications running on servers housed in tens of data centers geographically spread out. T...
Rahul Singh, Prashant J. Shenoy, K. K. Ramakrishna...
EDBT
2009
ACM
118views Database» more  EDBT 2009»
15 years 6 months ago
Optimized union of non-disjoint distributed data sets
In a variety of applications, ranging from data integration to distributed query evaluation, there is a need to obtain sets of data items from several sources (peers) and compute ...
Itay Dar, Tova Milo, Elad Verbin
IROS
2009
IEEE
192views Robotics» more  IROS 2009»
15 years 6 months ago
Kinodynamic motion planning for mobile robots using splines
— This paper presents an approach to time-optimal kinodynamic motion planning for a mobile robot. A global path planner is used to generate collision-free straight-line paths fro...
Boris Lau, Christoph Sprunk, Wolfram Burgard