Sciweavers

147 search results - page 10 / 30
» Path Planning Through Variational Dynamic Programming
Sort
View
IROS
2008
IEEE
142views Robotics» more  IROS 2008»
15 years 4 months ago
Probabilistic mapping of dynamic obstacles using Markov chains for replanning in dynamic environments
— Robots acting in populated environments must be capable of safe but also time efficient navigation. Trying to completely avoid regions resulting from worst case predictions of...
Florian Rohrmüller, Matthias Althoff, Dirk Wo...
ESOP
2006
Springer
15 years 1 months ago
Path Optimization in Programs and Its Application to Debugging
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
Akash Lal, Junghee Lim, Marina Polishchuk, Ben Lib...
DSN
2009
IEEE
15 years 4 months ago
Fitness-guided path exploration in dynamic symbolic execution
Dynamic symbolic execution is a structural testing technique that systematically explores feasible paths of the program under test by running the program with different test input...
Tao Xie, Nikolai Tillmann, Jonathan de Halleux, Wo...
PLDI
2012
ACM
13 years 1 days ago
Sound and precise analysis of parallel programs through schedule specialization
Parallel programs are known to be difficult to analyze. A key reason is that they typically have an enormous number of execution interleavings, or schedules. Static analysis over...
Jingyue Wu, Yang Tang, Gang Hu, Heming Cui, Junfen...
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
15 years 2 months ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom