Global path planning algorithms are good in planning an optimal path in a known environment, but would fail in an unknown environment and when reacting to dynamic and unforeseen obstacles. Conversely, local navigation algorithms perform well in reacting to dynamic and unforeseen obstacles but are susceptible to local minima failures. A hybrid integration of both the global path planning and loc...

This research presents an optimization technique for route planning using simulated ant agents for dynamic online route planning and optimization of the route. It addresses the issues involved during route planning in dynamic and unknown environments cluttered with obstacles and objects. A simulated ant agent system (SAAS) is proposed using modified ant colony optimization algorithm for dealing...

Planning robot trajectory is a complex task that plays a significant role in design and application of robots in task space. The problem is formulated as a trajectory optimization problem which is fundamentally a constrained nonlinear optimization problem. Open-loop optimal control method is proposed as an approach for trajectory optimization of cable parallel manipulator for a given two-end-po...

guiding vehicles to their destination under dynamic traffic conditions is an important topic in the field of intelligent transportation systems (its). nowadays, many complex systems can be controlled by using multi agent systems. adaptation with the current condition is an important feature of the agents. in this research, formulation of dynamic guidance for vehicles has been investigated based...

this paper focuses on formulating capacity-price trade off problem in yield management for manufactur-ing industry by drawing motivation from the remarkable success of yield management (ym) implementation in airlines. in the current practice, there is no alternative and procedure for the manufacturer, as well as cus-tomers to take advantage of using the unfulfilled capacity in discounted offers...

We present a novel optimization-based algorithm for motion planning in dynamic environments. Our approach uses a stochastic trajectory optimization framework to avoid collisions and satisfy smoothness and dynamics constraints. Our algorithm does not require a priori knowledge about global motion or trajectories of dynamic obstacles. Rather, we compute a conservative local bound on the position ...

Because traditional obstacle avoidance path planning methods have a lot of problems, such as large amount of calculation, low efficiency, poor optimization capability, and lack of dealing with dynamic obstacles, a new method which implements real-time path planning of mobile robot is presented. The method builds a neural network model for the robot workspace, and then it uses the model to obtai...

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 real-time planning in dynamic environments fail in the high-dimensional state space required to plan high-speed ...

My research is in the area of robotics, computer animation and graphics. A focus of my research deals with integrating aspects of robotic motion planning with animation applications. The main applications include pursuit-evasion scenarios, evacuation planning and motion planning in dynamic and complex environments. We have shown that the behavior of a group of agents can be improved by utilizin...

The continued development of strategic planning processes in electric utilities is of utmost importance, given their increasingly complex, dynamic markets. Development will be blocked unless electric utilities begin developing and integrating other organization systems within their strategic planning processes to create "strategic support ·systems". This article describes three dimensions for a...