a real-time path planning approach without the computation of cspace obstacles

An important concept proposed in the early stage of robot path planning field is the shrinking of the robot to a point and meanwhile expanding of the obstacles in the workspace as a set of new obstacles. The resulting grown obstacles are called the Configuration Space (Cspace) obstacles. The find-path problem is then transformed into that of finding a collision free path for a point robot among the Cspace obstacles. However, the research experiences obtained so far have shown that the calculation of the Cspace obstacles is very hard work when the following situations occur: 1. both the robot and obstacles are not polygons and 2. the robot is allowed to rotate. This situation is even worse when the robot and obstacles are three dimensional (3D) objects with various shapes. Obviously a direct path planning approach without the calculation of the Cspace obstacles is strongly needed. This paper presents such a new real-time robot path planning approach which, to the best of our knowledge, is the first one in the robotic community. The fundamental ideas are the utilization of inequality and optimization technique. Simulation results have been presented to show its merits.

A shortest path algorithm for moving objects in spatial network databases

One of the most important kinds of queries in Spatial Network Databases (SNDB) to support location-based services (LBS) is the shortest path query. Given an object in a network, e.g. a location of a car on a road network, and a set of objects of interests, e.g. hotels,gas station, and car, the shortest path query returns the shortest path from the query object to interested objects. The studies of shortest path query have two kinds of ways, online processing and preprocessing. The studies of preprocessing suppose that the interest objects are static. This paper proposes a shortest path algorithm with a set of index structures to support the situation of moving objects. This algorithm can transform a dynamic problem to a static problem. In this paper we focus on road networks. However, our algorithms do not use any domain specific information, and therefore can be applied to any network. This algorithm’s complexity is O(klog2 i), and traditional Dijkstra’s complexity is O((i + k)2).

a shortest path algorithm for moving objects in spatial network databases

中国计算机学会

SBS-based slow light in optical fibers: optimum design considerations for undistorted slow-light signal propagation in steady-state and transient regimes

SPIE

Analysis of the lateral displacement and optical path difference in wide-field-of-view polarization interference imaging spectrometer

The mechanism of beam splitting and principle of wide-field-of-view compensation of modified Savart polariscope in the wide-field-of-view polarization interference imaging spectrometer (WPIIS) are analyzed and discussed. Formulas for the lateral displacement and optical path difference (OPD) produced by the modified Savart polariscope are derived by ray-tracing method. The theoretical and practical guidance is thereby provided for the study, design, modulation, experiment and engineering of the polarization interference imaging spectrometers and other birefringent Fourier-transform spectrometers based on Savart polariscopes. (c) 2006 Elsevier B.V. All rights reserved.

Is there a time-transgressive Holocene optimum in the East Asian monsoon area?

IEECAS SKLLQG

Faddeev-Jackiw canonical path integral quantization for a general scenario, its proper vertices and generating functionals

We generalize the Faddeev-Jackiw canonical path integral quantization for the scenario of a Jacobian with J=1 to that for the general scenario of non-unit Jacobian, give the representation of the quantum transition amplitude with symplectic variables and obtain the generating functionals of the Green function and connected Green function. We deduce the unified expression of the symplectic field variable functions in terms of the Green function or the connected Green function with external sources. Furthermore, we generally get generating functionals of the general proper vertices of any n-points cases under the conditions of considering and not considering Grassmann variables, respectively; they are regular and are the simplest forms relative to the usual field theory.

The Main Path to C, N, O Elements in Big Bang Nucleosynthesis

The production of C, N, O elements in a standard big bang nucleosynthesis scenario is investigated. Using the up-to-date data of nuclear reactions in BBN, in particular the Li-8 (n, gamma) Li-9 which has been measured in China Institute of Atomic Energy, a full nucleosynthesis network calculation of BBN is carried out. Our calculation results show that the abundance of C-12 is increased for an order of magnitude after addition of the reaction chain Li-8(n, gamma) Li-9(alpha, n) B-12(beta) C-12, which was neglected in previous studies. We find that this sequence provides the main channel to convert the light elements into C, N, O in standard BBN.

Coherent classical-path description of deep tunneling

A central challenge to the semiclassical description of quantum mechanics is the quantum phenomenon of "deep" tunneling. Here we show that real time classical trajectories suffice to account correctly even for deep quantum tunneling, using a recently formulated semiclassical initial value representation series of the quantum propagator and a prefactor free semiclassical propagator. Deep quantum tunneling is effected through what we term as coherent classical paths which are composed of one or more classical trajectories that lead from reactant to product but are discontinuous along the way. The end and initial phase space points of consecutive classical trajectories contributing to the coherent path are close to each other in the sense that the distance between them is weighted by a coherent state overlap matrix element. Results are presented for thermal and energy dependent tunneling through a symmetric Eckart barrier.