For finding a shortest path in a network the bidirectional A* algorithm is a widely known algorithm. An A* instance requires a heuristic estimate, a real-valued function on the set of nodes. The version of bidirectional A* that is considered the most appropriate in literature hitherto, uses so-called balanced heuristic estimates. This means that the two estimates of the two directions are in ba...

In design and analysis, standard references assume the pedestrian flow as unidirectional. In reality however, pedestrian flow is usually bi-directional. The main question pursued in this paper is that whether the main characteristics of pedestrian flow the same under uni- and bi-directional conditions. In order to achieve this goal, effect of bi-directional stream is inv...

Elliptic curves find numerous applications. This paper describes a simple strategy to speed up their arithmetic in right-to-left methods. In certain settings, this leads to a non-negligible performance increase compared to the left-to-right counterparts.

We propose bi-directional face traversal algorithm 2FACE to shorten the path the message takes to reach the destination in geometric routing. Our algorithm combines the practicality of the best singledirection traversal algorithms with the worst case message complexity of O(|E|), where E is the number of network edges. We apply 2FACE to a variety of geometric routing algorithms. Our simulation ...

We propose bi-directional face traversal algorithm 2FACE to shorten the path the message takes to reach the destination in geometric routing. Our algorithm combines the practicality of the best singledirection traversal algorithms with the worst case message complexity of O(|E|), where E is the number of network edges. We apply 2FACE to a variety of geometric routing algorithms. Our simulation ...

We consider the 2-Way Multi Modal Shortest Path Problem (2WMMSPP). Its goal is to find two multi modal paths with total minimal cost, an outgoing path and a return path. The main difficulty lies in the fact that if a private car or bicycle is used during the outgoing path, it has to be picked up during the return path. The shortest return path is typically not equal to the shortest outgoing pat...

AGV systems are now becoming widely used in automatic material handling systems. One of the issues arising in applications is routing. This paper presents a bi-directional path layout and an algorithm for routing AGVs without conflicts. Mathematical relationships among certain key parameters of path and vehicle are derived to minimize the space requirements of the layout. The routing efficiency...

the dogleg severity is one of the most important parameters in directional drilling. improvement of these indicators actually means choosing the best conditions for the directional drilling in order to reach the target point. selection of high levels of the dogleg severity actually means minimizing well trajectory, but on the other hand, increases fatigue in drill string, increases torque and d...

And-or graphs and theorem-proving graphs determine the same kind of search space and differ only in the direction of search: from axioms to goals, in the case of theorem-proving graphs, and in the opposite direction, from goals to axioms, in the case of and-or graphs. Bi-directional search strategies combine both directions of search. We investigate the construction of a single general algorith...

We present a parallel path planning method that is able to automatically handle multiple goal configurations as input. There are two basic approaches, goal switching and bidirectional search, which are combined in the end. Goal switching dynamically selects a favourite goal depending on some distance function. The bi-directional search supports the backward search direction from the goal to the...