نتایج جستجو برای: path planning

تعداد نتایج: 328855  

Journal: :international journal of robotics 0
saeed mansouri isfahan university of technology mohammad jafar sadigh isfahan university of technology

stability and performance are two main issues in motion of bipeds. to ensure stability of motion, a biped needs to follow specific pattern to comply with a stability criterion such as zero moment point. however, there are infinity many patterns of motion which ensure stability, so one might think of achieving better performance by choosing proper parameters of motion. step length and step perio...

2013
Hendri Himawan Triharminto Anton Satria Prabuwono Teguh Bharata Adji Noor Akhmad Setiawan Nak Young Chong

An Unmanned Aerial Vehicle (UAV) has to possess three abilities to function autonomously. The three abilities are localization, mapping and path planning. Path planning guides the UAV to find a feasible path, meaning a path that meets safety, kinematic and optimization constrains. In order to intercept a moving target, dynamic path planning must be used due to target movement. To produce a feas...

1999
Kazuo SUGIHARA John SMITH

This paper proposes genetic algorithms (GAs) for path planning and trajectory planning of an autonomous mobile robot. Our GA-based approach has an advantage of adaptivity such that the GAs work even if an environment is time-varying or unknown. Therefore, it is suitable for both off-line and on-line motion planning. We first presents a GA for path planning in a 2D terrain. Simulation results on...

2015
Tansel Uras Sven Koenig

Simple Subgoal Graphs are constructed from grids by placing subgoals at the corners of obstacles and connecting them. They are analogous to visibility graphs for continuous terrain but have fewer edges and can be used to quickly find shortest paths on grids. The vertices of a Simple Subgoal Graph can be partitioned into different levels to create N-Level Subgoal Graphs, which can be used to fin...

2013
Xianmin Wei

As for the limitations of algorithms in global path planning of mobile robot at present, this study applies the improved simulated annealing algorithm artificial neural networks to path planning of mobile robot in order to better the weaknesses of great scale of iteration computation and slow convergence, since the best-reserved simulated annealing algorithm was introduced and it was effectivel...

2004
Saul Simhon Gregory Dudek

We present a probabilistic method for path planning that considers trajectories constrained by both the environment and an ensemble of restrictions or preferences on preferred motions for a moving robot. Our system learns constraints and preference biases on a robot’s motion from examples, and then synthesizes behaviors that satisfy these constraints. This behavior can encompass motions that sa...

2003
Sven Behnke

Grid-based methods for finding cost optimal paths are popular because of their flexibility and simple implementation. However, their computational complexity becomes unfeasible for real-time path planning if the resolution of the grid is high. These methods assume complete knowledge about the world, but in dynamic environments where sensing is done on board the robot, less is known about far-aw...

Journal: :CoRR 2016
Gabriele Costante Christian Forster Jeffrey A. Delmerico Paolo Valigi Davide Scaramuzza

In this paper, we give a double twist to the problem of planning under uncertainty. State-of-the-art planners seek to minimize the localization uncertainty by only considering the geometric structure of the scene. In this paper, we argue that motion planning for vision-controlled robots should be perception aware in that the robot should also favor texture-rich areas to minimize the localizatio...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید