scholarly journals An All-Time-Domain Moving Object Data Model, Location Updating Strategy, and Position Estimation

2015 ◽  
Vol 11 (11) ◽  
pp. 463749 ◽  
Author(s):  
Qunyong Wu ◽  
Junyi Huang ◽  
Jianping Luo ◽  
Jianjun Yang
Keyword(s):  
Time Domain ◽  
Data Model ◽  
Position Estimation ◽  
Moving Object ◽  
Location Updating

Object-oriented full-time domain moving object data model

2013 ◽  
Vol 33 (4) ◽  
pp. 1015-1017
Author(s):  
Jianping LUO ◽  
Qunyong WU ◽  
Li ZHU
Keyword(s):  
Time Domain ◽  
Data Model ◽  
Object Oriented ◽  
Moving Object ◽  
Full Time

Position Estimation for IR-UWB Systems

2018 ◽  
pp. 274-316
Author(s):  
Eva Lagunas ◽  
Monica Navarro ◽  
Pau Closas ◽  
Montse Najar ◽  
Ricardo Garcia-Gutierrez ◽  
...  
Keyword(s):  
Wireless Networks ◽  
Time Domain ◽  
Spatial Domain ◽  
Position Estimation ◽  
Promising Candidate ◽  
Emitter Location ◽  
Step Procedure ◽  
Toa Estimation ◽  
Single Emitter ◽  
Short Time

IR-UWB has emerged as a promising candidate for positioning passive nodes in wireless networks due to its extremely short time domain transmitted pulses. The two-step approaches in which first different TOAs are estimated and then fed into a triangulation procedure are suboptimal in general. This is because in the first stage of these methods, the measurements at distinct anchors are independent and ignore the constraint that all measurements must be consistent with a single emitter location. In this chapter, the authors investigate two techniques to overcome this issue. First, a two-step procedure based on multi-TOA estimation is proposed. Second, a positioning approach omitting the intermediate known as DPE is presented. Complementarily, the authors explore the CS-based modeling of both approaches so that the temporal sparsity of the UWB received signal and the consequent sparseness of the discrete spatial domain are exploited to select the most significant TOAs and to reduce the amount of information to be sent to a central fusion unit in the DPE approach.

Geometric Modeling of a Moving Object With Self-Intersection

1995 ◽  
Author(s):  
Zeng-Jia Hu ◽  
Zhi-Kui Ling
Keyword(s):  
Cross Sections ◽  
Time Domain ◽  
Geometric Modeling ◽  
Moving Object ◽  
The Self ◽  
Graphical Solution ◽  
Simple Polygons ◽  
Swept Volume ◽  
Facet Model

Abstract The solution to the self-intersection of a swept volume is the bottleneck to the geometric modeling of a moving object. Self-intersection of a swept volume is the result of an object, which is called a generator here, moving into a space which it previously occupied. A graphical solution is devised in this study. It consists of following steps. First of all, a candidate swept volume is created by warping a series of characteristics curves on the boundary of the generator in a given time domain. The result is the facet model of a swept volume. Secondly, a series of sectioning operations to the candidate swept volume are performed where the sectioning planes are parallel. If self-intersection exists for a given candidate swept volume, some of the resulting polygons (cross-sections) after the sectioning operations are complex polygons. Thirdly, an algorithm is proposed here to convert these polygons into sweep contours, which are simple polygons. A well defined facet model of the swept volume is then obtained by fitting the corresponding sweep contours with a surface.

Sign in / Sign up

Export Citation Format

Share Document