نتایج جستجو برای: path following problem
تعداد نتایج: 1580933 فیلتر نتایج به سال:
Robotic navigation is the aspect of cognition related to robot robust mobility. It combines perception, some knowledge on environment and a set goal poses reliably control during mission that involves displacement. Vision-based autonomous an instantiation latter discipline where visual perception used represent environment. This article presents vision-based system uses its onboard camera navig...
For many tasks, predictive path-following control can significantly improve the performance and robustness of autonomous robots over traditional trajectory tracking control. It does this by prioritizing closeness to the path over timed progress along the path and by looking ahead to account for changes in the path. We propose a novel predictive pathfollowing approach that couples feedforward li...
Consider the following modification to the shortest path query problem in polygonal domains: instead of finding shortest path to a query point q, we find the shortest path to any point that sees q. We present an interactive visualization applet visualizing these quickest visibility paths. The applet also visualizes quickest visibility maps, that is the subdivision of the domain into cells by th...
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
project planning is part of project management, which is relates to the use of schedules such as gantt charts to plan and subsequently report progress within the project environment. initially, the project scope is defined and the appropriate methods for completing the project are determined. in this paper a new approach for the critical path analyzing a project network with random fuzzy activi...
In this paper we show that a very simple and efficient approach can be used to solve the all pairs almost shortest path problem on the class of weakly chordal graphs and its different subclasses. Moreover, this approach works well also on graphs with small size of largest induced cycle and gives a unified way to solve the all pairs almost shortest path and all pairs shortest path problems on di...
In the maximum flow network interdiction problem, an attacker attempts to minimize the maximum flow by interdicting flow on the arcs of network. In this paper, our focus is on the nodal interdiction for network instead of the arc interdiction. Two path inequalities for the node-only interdiction problem are represented. It has been proved that the integrality gap of relaxation of the maximum fl...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید