Consider the problem of moving a rigid body as quickly as possible between two configurations in a plane without obstacles. There may be many trajectories between the two configurations; which trajectories are fastest depends on the available controls. For example, the fastest way to move a kinematic model of a car with bounded steering angle a short distance sideways might be to execute a part...

the most current pursuit algorithms for moving targets which are presented so far in the literatureare pure pursuit and pure rendezvous navigations. recently, one of the present authors has introduced ageometric model for the pure pursuit navigation algorithm. here, in this paper, we study a new algorithm forthe pursuit navigation problem which is a combination of both of the above algorithms. ...

Current UAV control systems can plan optimal trajectories with respect to predefined constraints (waypoints, nofly zones). However when the operator is not satisfied with planned trajectories it is usually very complicated to force the system to change the trajectories in desired way. In this demonstration we solve this problem by innovative UAV control display based on diverse planning algorithm.

Dynamic optimization offers a great potential for maximizing performance of continuous processes from startup to shutdown by obtaining optimal trajectories for the control variables. However, numerical procedures for dynamic optimization can become prohibitively costly upon a sufficiently fine discretization of control trajectories, especially for large-scale dynamic process models. On the othe...

This article considers continuous trajectories of the vector fields induced by primaldual potential-reduction algorithms for solving linear programming problems. It is known that these trajectories converge to the analytic center of the primal-dual optimal face. We establish that this convergence may be tangential to the central path, tangential to the optimal face, or in between, depending on ...