the large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. most of this computational burden is due to calculation of switching points. in this paper a learning algorithm is proposed for finding the switching points. the method, which can be used for both ...

The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...

In the current era, the wireless cellular network is gaining much attention in the network mobility for qualitative service. Towards enhancing the QoS and narrowing the dilemma of network management (location management) an efficient metric-based location management technique is introduced in this paper to capture the current location of mobile subscribers. The attributes of this technique are ...

If an optimal control problem (OCP) for hybrid systems with autonomous switching is solved by use of the hybrid minimum principle (HMP), it is necessary to apply the HMP to each possible discrete location sequence separately, i.e. the complexity is exponential in the number of switches. To reduce the combinatorial complexity, this paper proposes a graph search algorithm where the graph encodes ...