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

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

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...

2010
Kashif Zafar Abdul Rauf Baig Ayesha Khan B. Yamauchi A. Howard M. J. Mataric K Zafar A. R. Baig S. Badar S. Ahn N. L. Doh K. Lee W. K. Chung

This research presents a collaborative evolutionary planning framework for large scale grid exploration and planning problems. It caters for both dynamic and unknown environments using evolutionary techniques. In addition, we integrate the exploration and planning process in a unified framework using multi agent system. As a proof of success, we have developed extensive simulations with realist...

2012
Jarad Cannon Kevin Rose Wheeler Ruml

Robust robot motion planning in dynamic environments requires that actions be selected under real-time constraints. Existing heuristic search methods that can plan high-speed motions do not guarantee real-time performance in dynamic environments. Existing heuristic search methods for realtime planning in dynamic environments fail in the highdimensional state space required to plan high-speed ac...

Journal: :CoRR 2009
Nicolas A. Barriga

This document is a thesis on the subject of single-agent on-line path planning in continuous,unpredictable and highly dynamic environments. The problem is finding and traversing a collision-free path for a holonomic robot, without kinodynamic restrictions, moving in an environment with several unpredictably moving obstacles or adversaries. The availability of perfect information of the environm...

2004
Craig Boutilier

Markov decision processes (MDPs) have become the de facto standard model for decision-theoretic planning problems. However, classic dynamic programming algorithms for MDPs [22] require explicit state and action enumeration. For example, the classical representation of a value function is a table or vector associating a value with each system state; such value functions are produced by iterating...

2002
Giuseppe Oriolo Alessandro De Luca

We present a method for trajectory planning and control of planar robots with a passive rotational last joint. These underactuated mechanical systems, which are subject to nonholonomic second-order constraints, are shown to be fully linearized and input-output decoupled by means of a nonlinear dynamic feedback. This objective is achieved in a unified framework, both in the presence or absence o...

Journal: :Robotics and Autonomous Systems 2014
Stephen Cossell José E. Guivant

This paper presents a concurrent approach for solving dynamic programming optimization problems such as the generation of optimal cost-to-go functions for robot motion planning in dense environments. Such optimization techniques are core to many robotics problems, but traditional approaches are inherently impractical due to their computational complexity. This limitation usually results in a co...

2017
Hao-Tien Lewis Chiang Baisravan HomChaudhuri Lee Smith Lydia Tapia

Providing safety guarantees for autonomous vehicle navigation is an ultimate goal for motion planning in dynamic environments. However, due to factors such as robot and obstacle dynamics, e.g., speed and nonlinearity, obstacle motion uncertainties, and a large number of moving obstacles, identifying complete motion planning solutions with collision-free safety guarantees is practically unachiev...

2017

This chapter intends to give an overview of the literature on dynamic lot-sizing models and stochastic transshipment models. These two types of models are used as a basis for developing models with substitution in the following chapters. Section 2.1 contains a classification of models for dynamic lot-sizing / production planning, and selected models. In Sect. 2.2, we give a brief overview of av...

2018

This chapter intends to give an overview of the literature on dynamic lot-sizing models and stochastic transshipment models. These two types of models are used as a basis for developing models with substitution in the following chapters. Section 2.1 contains a classification of models for dynamic lot-sizing / production planning, and selected models. In Sect. 2.2, we give a brief overview of av...

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

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