Most of the emphasis in path planning, a topic of much interest in several domains, has been on finding the optimal path or at most k optimal paths, but in domains such as adversarial planning, one of the agents might deliberately take less optimal paths to confuse the opponent, and by the same token an agent, for inferring opponent’s intent, has to consider all possible paths that the opponent...

In this paper, we consider the minimization of the longest path length (LPL) for binary decision diagrams (BDDs) and heterogeneous multi-valued decision diagrams (MDDs). Experimental results show that: (1) For many logic functions, node minimization of BDDs also minimizes the LPLs of BDDs. (2) When we use heterogeneous MDDs for representing logic functions and minimize the memory sizes of heter...

Due to the complex constraints, more uncertain factors and critical real-time demand of path planning for unmanned combat aerial vehicle (UCAV), an approach of fast path planning based on Voronoi diagram and pre-evolution genetic algorithm (PEGA) is proposed, which makes use of the principle of hierarchical path planning. First the Voronoi diagram is utilized to generate the initial paths and c...

The notorious middle two levels problem is to find a Hamilton cycle in the middle two levels, M2k+1, of the Hasse diagram of B2k+1 (the partially ordered set of subsets of a 2k + 1-element set ordered by inclusion). Previously, the best known result, due to Moews and Reid [11] in 1990, was that M2k+1 is Hamiltonian for all positive k through k = 11. We show that if a Hamilton path between two d...

Scalar field systems containing higher derivatives are studied and quan-tized by Hamiltonian path integral formalism. A new point to previous quantization methods is that field functions and their time derivatives are considered as independent canonical variables. Consequently, generating functional, explicit expressions of propagators and Feynman diagrams in φ 3 theory are found.

We consider the path length in decision diagrams for multiple-valued functions. This is an important measure of a decision diagram, since this models the time needed to evaluate the function. We focus on the average path length (APL), which is the sum of the path lengths over all assignments of values to the variables divided by the number of assignments. First, we show a multiple-valued functi...

This paper addresses the task assignment and path planning problem of multiple UAVs. As one of the strategies for a SEAD(Suppressions of Enemy Air Defense) mission, an efficiency strategy for assignment and path planning of homogeneous UAVs is developed. There are many path planning methods (e.g. potential function method or probabilistic roadmap method) to avoid obstacles, but the Voronoi diag...

For displaying a dense graph, an adjacency matrix is superior than a node-link diagram because it is more compact and free of visual clutter. A node-link diagram, however, is far better for the task of path finding because a path can be easily traced by following the corresponding links, provided that the links are not heavily crossed or tangled. We augment adjacency matrices with path visualiz...

in this study, an extended stress-based forming limit diagram (fld) for prediction of necking based on the marciniak and kucznski (m-k) model is represented and applied in tube hydroforming. the bulge forming of a straight tube is simulated by finite element method and verified with published experimental data. this adaptive simulation technique is based on the ability to detect the onset and g...