scholarly journals A Study on the Model of Detecting the Variation of Geomagnetic Intensity Based on an Adapted Motion Strategy

Sensors ◽  
2017 ◽  
Vol 18 (2) ◽  
pp. 39
Author(s):  
Hong Li ◽  
Mingyong Liu ◽  
Kun Liu ◽  
Feihu Zhang
Keyword(s):  
Motion Strategy ◽  
Geomagnetic Intensity

scholarly journals A VISIBILITY-BASED PURSUIT-EVASION PROBLEM

1999 ◽  
Vol 09 (04n05) ◽  
pp. 471-493 ◽  
Author(s):  
LEONIDAS J. GUIBAS ◽  
JEAN-CLAUDE LATOMBE ◽  
STEVEN M. LAVALLE ◽  
DAVID LIN ◽  
RAJEEV MOTWANI
Keyword(s):  
Finite Graph ◽  
Initial Position ◽  
Moving Target ◽  
Multiply Connected ◽  
Pursuit Evasion ◽  
Minimum Number ◽  
Evasion Problem ◽  
Free Spaces ◽  
Simply Connected ◽  
Motion Strategy

This paper addresses the problem of planning the motion of one or more pursuers in a polygonal environment to eventually "see" an evader that is unpredictable, has unknown initial position, and is capable of moving arbitrarily fast. This problem was first introduced by Suzuki and Yamashita. Our study of this problem is motivated in part by robotics applications, such as surveillance with a mobile robot equipped with a camera that must find a moving target in a cluttered workspace. A few bounds are introduced, and a complete algorithm is presented for computing a successful motion strategy for a single pursuer. For simply-connected free spaces, it is shown that the minimum number of pursuers required is Θ( lg  n). For multiply-connected free spaces, the bound is [Formula: see text] pursuers for a polygon that has n edges and h holes. A set of problems that are solvable by a single pursuer and require a linear number of recontaminations is shown. The complete algorithm searches a finite graph that is constructed on the basis of critical information changes. It has been implemented and computed examples are shown.

scholarly journals An Efficient Motion Strategy to Compute Expected-Time Locally Optimal Continuous Search Paths in Known Environments

2009 ◽  
Vol 23 (12-13) ◽  
pp. 1533-1560 ◽  
Author(s):  
Alejandro Sarmiento ◽  
Rafael Murrieta-Cid ◽  
Seth Hutchinson
Keyword(s):  
Expected Time ◽  
Motion Strategy

Analysis of 11 Myr of geomagnetic intensity variation

1998 ◽  
Vol 103 (B8) ◽  
pp. 17735-17748 ◽  
Author(s):  
Catherine G. Constable ◽  
Lisa Tauxe ◽  
Robert L. Parker
Keyword(s):  
Intensity Variation ◽  
Geomagnetic Intensity

Geomagnetic intensity as evaluated from ancient Chinese pottery

Nature ◽  
1987 ◽  
Vol 328 (6128) ◽  
pp. 330-333 ◽  
Author(s):  
Wei Quing-Yun ◽  
Zhang Wei-Xi ◽  
Li Dong-Jie ◽  
M. J. Aitken ◽  
G. D. Busseil ◽  
...  
Keyword(s):  
Geomagnetic Intensity

scholarly journals A tectonomagnetic effect detected in Central Italy

1994 ◽  
Vol 37 (1) ◽  
Author(s):  
G. Mele ◽  
A. Meloni ◽  
P. Palangio
Keyword(s):  
Field Intensity ◽  
Geomagnetic Field ◽  
Central Italy ◽  
Volcanic Eruptions ◽  
Intensity Data ◽  
Absolute Level ◽  
Tectonic Events ◽  
Railway System ◽  
The Absolute ◽  
Geomagnetic Intensity

Significant variations in the absolute value of the geomagnetic field intensity related to tectonic events, as earthquakes and volcanic eruptions, have been observed in several cases. To detect such a tectonomagnetic effect related to seismic activity, a seismomagnetic network was installed by the Istituto Nazionale di Geofisica (ING) in the Abruzzi region (CentraI Italy), in July 1989. This area is being uplifting since the Pliocene. A logistic compromise between geophysical requirements and the electrified railway system tracks distribution led to the installation of five total magnetic field intensity data acquisition sites. From July 1989 to September 1992 geomagnetic intensity data were simultaneously recorded at all stations and compared to that recorded at the L'Aquila Observatory, located in the same area. A variation of about 10 nT in the absolute level of the geomagnetic field was measured at two stations located on the eastern side of the network. We suggest that the detected magnetic anomaly could resuIt from aseismic-changes in crustal stress during this time.

scholarly journals A New Decentralized Approach of Multiagent Cooperative Pursuit Based on the Iterated Elimination of Dominated Strategies Model

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Mohammed El Habib Souidi ◽  
Songhao Piao
Keyword(s):  
Game Theory ◽  
Coalition Formation ◽  
Decision Process ◽  
Pursuit Evasion ◽  
Dominated Strategies ◽  
Markov Decision ◽  
Simulation Results ◽  
The Given ◽  
Dynamic Formation ◽  
Motion Strategy

Game Theory is a promising approach to acquire coalition formations in multiagent systems. This paper is focused on the importance of the distributed computation and the dynamic formation and reformation of pursuit groups in pursuit-evasion problems. In order to address this task, we propose a decentralized coalition formation algorithm based on the Iterated Elimination of Dominated Strategies (IEDS). This Game Theory process is common to solve problems requiring the withdrawal of dominated strategies iteratively. Furthermore, we have used the Markov Decision Process (MDP) principles to control the motion strategy of the agents in the environment. The simulation results demonstrate the feasibility and the validity of the given approach in comparison with different decentralized methods.

scholarly journals Verification of visibility-based properties on multiple moving robots in an environment with obstacles

2018 ◽  
Vol 15 (4) ◽  
pp. 172988141878665 ◽  
Author(s):  
Ali Narenji Sheshkalani ◽  
Ramtin Khosravi
Keyword(s):  
State Space ◽  
Autonomous Robots ◽  
The State ◽  
Robot System ◽  
Discrete State ◽  
Verification Method ◽  
Distributed Processes ◽  
Analytical Proof ◽  
Motion Strategy ◽  
Multi Robot

A multi-robot system consists of a number of autonomous robots moving within an environment to achieve a common goal. Each robot decides to move based on information obtained from various sensors and gathered data received through communicating with other robots. In order to prove the system satisfies certain properties, one can provide an analytical proof or use a verification method. This article presents a new notion to prove visibility-related properties of a multi-robot system by introducing an automated verification method. Precisely, we propose a method to automatically generate a discrete state space of a given multi-robot system and verify the correctness of the desired properties by means of model-checking tools and algorithms. We construct the state space of a number of robots, each moves freely inside a bounded polygonal area with obstacles. The generated state space is then used to verify visibility properties (e.g. if the communication graph of robots is connected) by means of the construction and analysis of distributed processes model checker. Using our method, there is no need to analytically prove that the properties are preserved with every change in the motion strategy of the robots. We have implemented a tool to automatically generate the state space and verified some properties to demonstrate the applicability of our method in various environments.

Sign in / Sign up

Export Citation Format

Share Document