in this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses ferguson splines and pso (particle swarm optimization). the objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. ferguson splines create preliminary paths using random generated para...

The performance of dynamic path following of a wheeled mobile robot with nonholonomic constraints is highly affected by its initial states, because nonholonomically constrained system cannot guarantee the asymptotic stability for one equilibrium point of which errors and the time derivative of errors are zero. For this reason, the dynamic path following may yield poor performance with some init...

In this paper we describe an approach towards integrating mid-range sensing data into a dynamic path planning algorithm. The key problem, sensing for planning will be addressed in the context of outdoor navigation. An algorithmic approach is described towards solving these problems and both simulation results and initial experimental results for outdoor navigation using wide baseline stereo dat...

nowadays, it is common to find optimal point of the dynamic problem; dynamic problems whose optimal point changes over time require algorithms which dynamically adapt the search space instability. in the most of them, the exploitation of some information from the past allows to quickly adapt after an environmental change (some optimal points change). this is the idea underlining the use of memo...

This paper presents a fast algorithm for de-interlacing of video images using a shortest path technique. The algorithm applies dynamic programming techniques to find a shortest path in a cost matrix. The motion information obtained from this shortest path is used to re-align the fields of a video image. By using the shortest path via dynamic programming, the motion information estimated is more...

Based on environmental awareness and effective path planning algorithm, effective robot path planning can be achieved. In this paper, the Kinect sensor, the latest vision sensing technology, is used to perceive the obstacles and terrain information in dynamic environment in real-time, which enables robots to realize effective path planning tasks in complex dynamic environment. Using the real-im...

The main contribution of this paper is a new online routing algorithm, called Dynamic Online Routing Algorithm (DORA), for dynamic setup of bandwidth guaranteed paths in MPLS networks. The goal of DORA is to accept as many network path setup requests as possible by carefully mapping paths with reserved bandwidth evenly across the network. The key operation behind DORA is to avoid routing over l...

The shortest path tree construction is essential in network routing, and the Dijkstra algorithm, which is a static routing algorithm, is widely used. When some links in a network have new weights, dynamic routing algorithms are more efficient than static routing algorithms. This is because the dynamic routing algorithms reduce redundancy by recomputing only the affected sections of the network ...