We consider the problem of guiding mobile agents to visit a subset of sensor nodes called event nodes in wireless sensor networks without location information, where the set of event nodes is not known in advance. As the set of event nodes changes over time, a path needs to be updated on-line. We propose a novel distributed algorithm to construct and update such a dynamic path to visit a set of...

This paper considers the general capacity expansion path problem (GCEP) for the telecommunication operators. We investigate the polynomial equivalence between the GCEP problem and the constrained shortest path problem (CSP) and present a pseudopolynomial algorithm for the GCEP problem, no matter the graph is acyclic or not. Furthermore, we investigate two special versions of the GCEP problem. F...

This is an annotated bibliography on fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and dynamic shortest paths. Although research on these problems spans over more than three decades, in the last couple of years many novel algorithmic techniques have been proposed. 1 Dynamic Path Problems A d...

This paper addresses the dynamic path planning for two mobile robots in unknownenvironment with obstacle avoidance and moving target tracking. These robots must form atriangle with moving target. The algorithm is composed of two parts. The first part of thealgorithm used for formation planning of the robots and a moving target. It generates thedesired position for the robots for the next step. ...

Aiming at the problems of low success rate and slow learning speed DDPG algorithm in path planning a mobile robot dynamic environment, an improved is designed. In this article, RAdam used to replace neural network optimizer DDPG, combined with curiosity improve convergence speed. Based on algorithm, priority experience replay added, transfer introduced training effect. Through ROS operating sys...

In this paper, we present an obstacle avoiding path planning method based on Voronoi diagram and composite Bezier curve algorithm which obtains the shortest path length. In our algorithm, a Voronoi diagram is constructed according to the global environment. The piecewise linear rough path in the Voronoi diagram which keeps away from the obstacles is obtained by performing Dijkstra’s shortest pa...

The continuous speech recognition problem is usually modeled as a search for the best path in a network of transitions between states. A full search can be very expensive in terms of computation and storage requirements. By adopting a segment based rather than a frame based approach, one can already obtain a reduction of these requirements, but this may still be insuucient to allow for real tim...