Search results

The purpose of this paper is to perform a comparative study of two propagation models and a prediction of proximity distances among the space objects based on the two-line element set (TLEs) data, which identifies potentially risky approaches and is used to compute the probability of collision among the spacecrafts.

At first, the proximities are estimated for the mentioned satellites using a precise propagation model and based on a one-month simulation. Then, a study is performed to determine the probability of collision between two satellites using a formulation which takes into account the object sizes, covariance data and the relative distance at the point of closest approach. Simplifying assumptions such as a linear relative motion and normally distributed position uncertainties at the predicted closest approach time are applied in estimation.

For the case of Iridium-Cosmos collision and the prediction of a closest approach using available TLE orbital data and a propagation model which takes into account the effects of the earth’s zonal harmonics and drag atmospheric, the maximum probability of about 2 × 10 −6 was obtained, which can indicate the necessity of enacting avoidance maneuvers regarding the defined a probability threshold by satellite’s owner.

The contribution of this paper is to analyze and simulate the 2009 prominent collision between the Cosmos2251 and Iridium33 satellite by modeling their orbit propagation, predicting their closest approaches and, finally, assessing the risk of the possible collision. Moreover, an enhanced orbit determination can be effective to achieve an accurate assessment of the ongoing collision threat to active spacecrafts from orbital debris and preventing, if necessary, the hazards thereof.

The purpose of this paper is to calculate the probability of collision of flying aircraft crossing on straight paths in any direction.

The probability of deviations from the intended flight paths is used to calculate the probability of collision that is integrated over time to cover whole events.

The probabilities of collision are calculated in terms of the r.m.s. position errors and encounter geometry, that is aircraft velocities and flight path angles and crossing angles.

The method does not apply to aircraft flying in parallel tracks at the same velocity in air corridors: that case has been covered elsewhere, as well as the case of climbing or descending aircraft.

International Civil Aviation Organization (ICAO) specifies as target level of safety (TLS) a probability of collision not exceeding 5×10⁻⁹ per hour. To meet the ICAO TLS standard, it is necessary to calculate collision probabilities for all stages of flight.

A low collision probability is a safety metric; the value does depend on a realist choice of probability distribution.

Calculates the probability of collision for crossing flights, corresponding to a common scenario on air traffic management.

The purpose of this paper is to propose a novel link assessment scheme where the link assessment packets are transmitted efficiently according to a set of non‐constant weight codes, which achieves low collision probability within a short link assessment period.

Each node considers the actual nodal degree while choosing the codeword for its link assessment. A link assessment procedure is designed and a set of theorems established that provide the necessary condition for successful link assessment.

The wireless mesh network (WMN) is experiencing tremendous growth with the standardization of IEEE 802.11 and IEEE 802.16 technologies. Compared to its wired counterpart, the resource of the WMN is limited. Worst yet, the wireless link quality is time and space varying, depending on the environment and interference. In order to make efficient use of the scarce channel resource during topology formation, scheduling and routing, it is vital to understand the quality of the links in the WMN (in terms of, e.g. probability of successful transmission or signal to noise ratio (SNR)). The existing approaches for link assessment consume substantial amount of time and thus introduce significant delay and overhead. Extensive simulations show that the proposed approach reduces link assessment delay by over 70 percent compared to the OOC‐based approach.

This scheme can help in faster link assessment and can lead to better routing, scheduling which contributes to higher throughput and better bandwidth utilization in any WMN.

The scheme defined in this paper can help in faster link assessment in WMN.

Internet of Things’ (IoT’s) first wave started with tracking services for better inventory management mainly using radio frequency identification (RFID) technology. Later on, monitoring services became one of the major interests, including sensing technologies, and then more actuation for remote control-type of IoT applications such as smart homes, smart cities and Industry 4.0. In this paper, the authors focus on the RFID technology impairment. They propose to take advantage of the mature IoT technologies that offer native service discovery such as blutooth or LTE D2D ProSe or Wifi Direct. Using the automatic service discovery in the new framework will make heterogeneous readers aware of the presence of other readers and this will be used by the proposed distributed algorithm to better control the multiple RFID reader interference problem. The author clearly considers emerging Industry 4.0 use case, where RFID technology is of major interest for both identification and tracking. To enhance the RFID tag reading performance, collisions in the RFID frequency should be minimized with reader-to-reader coordination protocols. In this paper, the author proposes a simple distributed reader anti-collision protocol named DiSim that makes use of proximity services of IoT network and is compliant with the current RFID standards. The author evaluates the efficiency of the proposal via simulation.

In this paper, the author proposes a simple distributed reader anti-collision protocol named DiSim that makes use of proximity services of IoT network and is compliant with the current RFID standards. The author evaluates the efficiency of the proposal via simulation to study its behavior in very dense and heterogeneous RFID environments. Specifically, the author explores the coexistence of powerful static readers and small mobile readers, comparing the proposal with a standard ETSI CSMA method. The proposal reduces significantly the number of access attempts, which are resource-expensive for the readers. The results show that the objectives of DiSim are met, producing low reader collision probability and, however, having lower average readings per reader per time.

DiSim is evaluated with the ETSI standard LBT protocol for multi-reader environments in several environments with varied levels of reader and tag densities, having both static powerful RFID readers and heterogeneous randomly moving mobile RFID readers. It effectively reduces the number of backoffs or contentions for the RFID channel. This has high reading success rate due to the avoided collisions; however, the readers are put to wait, and DiSim has less average readings per reader per time. As an additional side evaluation, the ETSI standard LBT mechanism was found to present a good performance for low-density mid-coverage scenarios, however, with high variability on the evaluation results.

To show more results, the author needs to do real experimentation in a warehouse, such as Amazon warehouse, where he expects to have more and more robots, start shelves, automatic item finding on the shelve, etc.

Future work considers experimentation in a real warehouse equipped with heterogeneous RFID readers and real-time analysis of RFID reading efficiency also combined with indoor localization and navigation for warehouse mobile robots.

More automatization is expected in the future; this work makes the use of RFID technology more efficient and opens more possibilities for services deployment in different domains such as the industry which was considered not only in this paper but also in smart cites and smart homes.

Compared to the literature, the proposal offers the advantage to not be dependent on a centralized server controlling the RFID readers. It also offers the possibility for an existing RFID architecture to add new readers from a different manufacturer, as the readers using the approach will have the possibility to discover the capabilities of the new interaction other RFID readers. This solution takes advantage of the available proximity service that will be more and more offered by the IoT technologies.

The purpose of this paper is to evaluate the safety of formation flying satellites, and propose a method for practical collision monitoring and collision avoidance manoeuvre.

A general formation description method based on relative orbital elements is proposed, and a collision probability calculation model is established. The formula for the minimum relative distance in the crosstrack plane is derived, and the influence of J2 perturbation on formation safety is analyzed. Subsequently, the optimal collision avoidance manoeuvre problem is solved using the framework of linear programming algorithms.

The relative orbital elements are illustrative of formation description and are easy to use for perturbation analysis. The relative initial phase angle between the in‐plane and cross‐track plane motions has considerable effect on the formation safety. Simulations confirm the flexibility and effectiveness of the linear programming‐based collision avoidance manoeuvre method.

The proposed collision probability method can be applied in collision monitoring for the proximity operations of spacecraft. The presented minimum distance calculation formula in the cross‐track plane can be used in safe configuration design. Additionally, the linear programming method is suitable for formation control, in which the initial and terminal states are provided.

The relative orbital elements are used to calculate collision probability and analyze formation safety. The linear programming algorithms are extended for collision avoidance, an approach that is simple, effective, and more suitable for on‐board implementation.

In manufacturing environments, mobile radio frequency identification (RFID) robots need to quickly identify and collect various types of passive tag and active tag sensor data. The purpose of this paper is to design a robot system compatible with ultra high frequency (UHF) band passive and active RFID applications and to propose a new anti-collision protocol to improve identification efficiency for active tag data collection.

A new UHF RFID robot system based on a cloud platform is designed and verified. For the active RFID system, a grouping reservation–based anti-collision algorithm is proposed in which an inventory round is divided into reservation period and polling period. The reservation period is divided into multiple sub-slots. Grouped tags complete sub-slot by randomly transmitting a short reservation frame. Then, in the polling period, the reader accesses each tag by polling. When tags’ reply collision occurs, the reader tries to re-query collided tags once, and the pre-reply tags avoid collisions through random back-off and channel activity detection.

The proposed algorithm achieves a maximum theoretical system throughput of about 0.94, and very few tag data frame transmissions overhead. The capture effect and channel activity detection in physical layer can effectively improve system throughput and reduce tag data transmission.

In this paper, the authors design and verify the UHF band passive and active hybrid RFID robot architecture based on cloud collaboration. And, the proposed anti-collision algorithm would improve active tag data collection speed and reduce tag transmission overhead in complex manufacturing environments.

The purpose of this paper is to study how to improve the performance of RFID robot system by anti-collision algorithms. For radio frequency identification (RFID) robots operating in mobile scenes, effective anti-collision algorithm not only reduces missed reading but also enhances the speed of RFID robots movement.

An effective anti-collision algorithm is proposed to accelerate tag identification in RFID robots systems in this paper. The tag collisions in the current time slot are detected by a new method, and then further resolve each small tag collision to improve system throughput, rather than the total tags number estimation. After the reader detected the collision, three different collision resolution methods were described and studied, and the situation of missing tag caused by reader moving is also discussed.

The proposed algorithm achieves theoretical system throughput of about 0.48, 0.50 and 0.61 and simulates to show that the proposed algorithm performance is significantly improved compared with the existing ALOHA-based algorithm.

The proposed RFID anti-collision algorithm is beneficial to improve the moving speed and identification reliability of the RFID robots in complex environments.