This paper addresses the problem of motion planning in dynamic environments. As dynamic environments impose a real-time constraint, the planner has a limited time only to compute a motion. Given the intrinsic complexity of motion planning, computing a complete motion to the goal within the time available is, in many real-life situations, impossible to achieve. Partial Motion Planning (PMP) is t...

Anytime algorithms are useful when the time available for computation is limited, that is, when there is a tradec~ between the time cost of further computation and the cost of using a solution that is only partially complete. Although machine planning presents this sort of problem, there has not yet been a treatment of anytime plAn-ing for the general case, that is, a treatment not tied to spec...

Lilies (Localisation and InterLeaving stragIES) was developed to deal with a forest fire fighting planning environment. The apphcation required adaptive planning in a reactive and generative environment. To model the application, it was necessary for multiple agents to be developed which added the usual communication [15, 19] issues. The planning environment needed to deal with both reactive an...

Reactive power planning is one of the most challenging problem for efficient and source operation of an interconnected power network. It requires effective and optimum co-ordination of all the reactive power sources present in the network. Recently, Teaching Learning Based Optimization (TLBO) algorithm is evolved and finds its application in the field of engineering optimization. In the propose...

This research focuses on finding the optimal location of reactive compensation in an unbalanced electrical power system (EPS). An EPS is named when there uncertainty behaviour demand, which causes changes voltage profile and angle each phases. For this reason, using will improve profiles magnitudes transmission lines. The proposed methodology uses AC flows as a basis, applied to phase and, thro...