For high level path planning, environments are usually modeled as distance graphs, and path planning problems are reduced to com­ puting the shortest path in distance graphs. One major drawback of this modeling is the inability to model uncertainties, which are of­ ten encountered in practice. In this paper, a new tool, called U-graph, is proposed for environment modeling. A U-graph is an ex­ t...

Graph-based Simultaneous Localization and Mapping (SLAM) has experienced a recent surge towards robust methods. These methods take the combinatorial aspect of data association into account by allowing decisions of the graph topology to be made during optimization. In this paper, the Generalized Graph SLAM framework for SLAM under ambiguous data association is presented, and a formal description...

Reasoning about three-dimensional scenes involves the analysis of large amounts of complex, time-varying information. This paper presents a novel representation for storing such information that provides a unified, intuitive framework for reasoning about rigid objects. The core structure is a graph that represents features of the scene as vertices, and stores distances between these features at...

This paper demonstrates the use of Point Graphs (PG) and temporal logic for analyzing courses of action (COA) in a Timed Influence Net (TIN) that models a dynamic uncertain situation. The current practice in courses of action analysis looks at the impacts of actions on the likelihood of the desired effects over a period of time. The impact of time, however, is not studied explicitly. This paper...

the option-pricing problem is always an important part in modern finance. assuming that the stock diffusion is a constant, some literature has introduced many stock models and given corresponding option pricing formulas within the framework of the uncertainty theory. in this paper, we propose a new stock model with uncertain stock diffusion for uncertain markets. some option pricing formulas on...

in this paper, controlling the gyros with linear plus cubic damping is considered. hence, an adaptive control algorithm is proposed to overcome the uncertainties in model parameters and the chaotic behavior of gyroscopes. it is noted that for general applications dynamic model coefficient of gyros is not precisely determined, on the other hand, with respect to a particular coefficient gyroscope...

0

the annihilating-ideal graph of a commutative ring $r$ is denoted by $ag(r)$, whose vertices are all nonzero ideals of $r$ with nonzero annihilators and two distinct vertices $i$ and $j$ are adjacent if and only if $ij=0$. in this article, we completely characterize rings $r$ when $gr(ag(r))neq 3$.

a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.

it is necessary to generate the automorphism group of a chemical graph in computer-aidedstructure elucidation. an euclidean graph associated with a molecule is defined by a weightedgraph with adjacency matrix m = [dij], where for i≠j, dij is the euclidean distance between thenuclei i and j. in this matrix dii can be taken as zero if all the nuclei are equivalent. otherwise,one may introduce dif...