327 research outputs found

    Composite Disturbance Filtering: A Novel State Estimation Scheme for Systems With Multi-Source, Heterogeneous, and Isomeric Disturbances

    Full text link
    State estimation has long been a fundamental problem in signal processing and control areas. The main challenge is to design filters with ability to reject or attenuate various disturbances. With the arrival of big data era, the disturbances of complicated systems are physically multi-source, mathematically heterogenous, affecting the system dynamics via isomeric (additive, multiplicative and recessive) channels, and deeply coupled with each other. In traditional filtering schemes, the multi-source heterogenous disturbances are usually simplified as a lumped one so that the "single" disturbance can be either rejected or attenuated. Since the pioneering work in 2012, a novel state estimation methodology called {\it composite disturbance filtering} (CDF) has been proposed, which deals with the multi-source, heterogenous, and isomeric disturbances based on their specific characteristics. With the CDF, enhanced anti-disturbance capability can be achieved via refined quantification, effective separation, and simultaneous rejection and attenuation of the disturbances. In this paper, an overview of the CDF scheme is provided, which includes the basic principle, general design procedure, application scenarios (e.g. alignment, localization and navigation), and future research directions. In summary, it is expected that the CDF offers an effective tool for state estimation, especially in the presence of multi-source heterogeneous disturbances

    Navigational Guidance – A Deep Learning Approach

    Get PDF
    The useful navigation guidance is favorable to considerably reducing navigation time. The navigation problems involved with multiple destinations are formulated as the Directed Steiner Tree (DST) problems over directed graphs. In this paper, we propose a deep learning (to be exact, graph neural networks) based approach to tackle the DST problem in a supervised manner. Experiments are conducted to evaluate the proposed approach, and the results suggest that our approach can effectively solve the DST problems. In particular, the accuracy of the network model can reach 95.04% or even higher

    Information Aided Navigation: A Review

    Full text link
    The performance of inertial navigation systems is largely dependent on the stable flow of external measurements and information to guarantee continuous filter updates and bind the inertial solution drift. Platforms in different operational environments may be prevented at some point from receiving external measurements, thus exposing their navigation solution to drift. Over the years, a wide variety of works have been proposed to overcome this shortcoming, by exploiting knowledge of the system current conditions and turning it into an applicable source of information to update the navigation filter. This paper aims to provide an extensive survey of information aided navigation, broadly classified into direct, indirect, and model aiding. Each approach is described by the notable works that implemented its concept, use cases, relevant state updates, and their corresponding measurement models. By matching the appropriate constraint to a given scenario, one will be able to improve the navigation solution accuracy, compensate for the lost information, and uncover certain internal states, that would otherwise remain unobservable.Comment: 8 figures, 3 table

    Mining Time-aware Actor-level Evolution Similarity for Link Prediction in Dynamic Network

    Get PDF
    Topological evolution over time in a dynamic network triggers both the addition and deletion of actors and the links among them. A dynamic network can be represented as a time series of network snapshots where each snapshot represents the state of the network over an interval of time (for example, a minute, hour or day). The duration of each snapshot denotes the temporal scale/sliding window of the dynamic network and all the links within the duration of the window are aggregated together irrespective of their order in time. The inherent trade-off in selecting the timescale in analysing dynamic networks is that choosing a short temporal window may lead to chaotic changes in network topology and measures (for example, the actors’ centrality measures and the average path length); however, choosing a long window may compromise the study and the investigation of network dynamics. Therefore, to facilitate the analysis and understand different patterns of actor-oriented evolutionary aspects, it is necessary to define an optimal window length (temporal duration) with which to sample a dynamic network. In addition to determining the optical temporal duration, another key task for understanding the dynamics of evolving networks is being able to predict the likelihood of future links among pairs of actors given the existing states of link structure at present time. This phenomenon is known as the link prediction problem in network science. Instead of considering a static state of a network where the associated topology does not change, dynamic link prediction attempts to predict emerging links by considering different types of historical/temporal information, for example the different types of temporal evolutions experienced by the actors in a dynamic network due to the topological evolution over time, known as actor dynamicities. Although there has been some success in developing various methodologies and metrics for the purpose of dynamic link prediction, mining actor-oriented evolutions to address this problem has received little attention from the research community. In addition to this, the existing methodologies were developed without considering the sampling window size of the dynamic network, even though the sampling duration has a large impact on mining the network dynamics of an evolutionary network. Therefore, although the principal focus of this thesis is link prediction in dynamic networks, the optimal sampling window determination was also considered

    Autonomous Approach and Landing Algorithms for Unmanned Aerial Vehicles

    Get PDF
    In recent years, several research activities have been developed in order to increase the autonomy features in Unmanned Aerial Vehicles (UAVs), to substitute human pilots in dangerous missions or simply in order to execute specific tasks more efficiently and cheaply. In particular, a significant research effort has been devoted to achieve high automation in the landing phase, so as to allow the landing of an aircraft without human intervention, also in presence of severe environmental disturbances. The worldwide research community agrees with the opportunity of the dual use of UAVs (for both military and civil purposes), for this reason it is very important to make the UAVs and their autolanding systems compliant with the actual and future rules and with the procedures regarding autonomous flight in ATM (Air Traffic Management) airspace in addition to the typical military aims of minimizing fuel, space or other important parameters during each autonomous task. Developing autolanding systems with a desired level of reliability, accuracy and safety involves an evolution of all the subsystems related to the guide, navigation and control disciplines. The main drawbacks of the autolanding systems available at the state of art concern or the lack of adaptivity of the trajectory generation and tracking to unpredicted external events, such as varied environmental condition and unexpected threats to avoid, or the missed compliance with the guide lines imposed by certification authorities of the proposed technologies used to get the desired above mentioned adaptivity. During his PhD period the author contributed to the development of an autonomous approach and landing system considering all the indispensable functionalities like: mission automation logic, runway data managing, sensor fusion for optimal estimation of vehicle state, trajectory generation and tracking considering optimality criteria, health management algorithms. In particular the system addressed in this thesis is capable to perform a fully adaptive autonomous landing starting from any point of the three dimensional space. The main novel feature of this algorithm is that it generates on line, with a desired updating rate or at a specified event, the nominal trajectory for the aircraft, based on the actual state of the vehicle and on the desired state at touch down point. Main features of the autolanding system based on the implementation of the proposed algorithm are: on line trajectory re-planning in the landing phase, fully autonomy from remote pilot inputs, weakly instrumented landing runway (without ILS availability), ability to land starting from any point in the space and autonomous management of failures and/or adverse atmospheric conditions, decision-making logic evaluation for key-decisions regarding possible execution of altitude recovery manoeuvre based on the Differential GPS integrity signal and compatible with the functionalities made available by the future GNSS system. All the algorithms developed allow reducing computational tractability of trajectory generation and tracking problems so as to be suitable for real time implementation and to still obtain a feasible (for the vehicle) robust and adaptive trajectory for the UAV. All the activities related to the current study have been conducted at CIRA (Italian Aerospace Research Center) in the framework of the aeronautical TECVOL project whose aim is to develop innovative technologies for the autonomous flight. The autolanding system was developed by the TECVOL team and the author’s contribution to it will be outlined in the thesis. Effectiveness of proposed algorithms has been then evaluated in real flight experiments, using the aeronautical flying demonstrator available at CIRA

    Finite Impulse Response Filtering Algorithm with Adaptive Horizon Size Selection and Its Applications

    Get PDF
    It is known, that unlike the Kalman filter (KF) finite impulse response (FIR) filters allow to avoid the divergence and unsatisfactory object tracking connected with temporary perturbations and abrupt object changes. The main challenge is to provide the appropriate choice of a sliding window size for them. In this paper, the new finite impulse response (FIR) filtering algorithm with the adaptive horizon size selection is proposed. The algorithm uses the receding horizon optimal (RHOFIR) filter which receives estimates, an abrupt change detector and an adaptive recurrent mechanism for choosing the window size. Monotonicity and asymptotic properties of the estimation error covariance matrix and the RHOFIR filter gain are established. These results form a solid foundation for justifying the principal possibility to tune the filter gain using them and the developed adaptation mechanism. The proposed algorithm (the ARHOFIR filter) allows reducing the impact of disturbances by varying adaptively the sliding window size. The possibility of this follows from the fact that the window size affects the filter characteristics in different ways. The ARHOFIR filter chooses a large horizon size in the absence of abrupt disturbances and a little during the time intervals of their action. Due to this, it has better transient characteristics compared to the KF and RHOFIR filter at intervals where there is temporary uncertainty and may provide the same accuracy of estimates as the KF in their absence. By simulation, it is shown that the ARHOFIR filter is more robust than the KF and RHOFIR filter for the temporarily uncertain systems

    Off-line evaluation of indoor positioning systems in different scenarios: the experiences from IPIN 2020 competition

    Get PDF
    Every year, for ten years now, the IPIN competition has aimed at evaluating real-world indoor localisation systems by testing them in a realistic environment, with realistic movement, using the EvAAL framework. The competition provided a unique overview of the state-of-the-art of systems, technologies, and methods for indoor positioning and navigation purposes. Through fair comparison of the performance achieved by each system, the competition was able to identify the most promising approaches and to pinpoint the most critical working conditions. In 2020, the competition included 5 diverse off-site off-site Tracks, each resembling real use cases and challenges for indoor positioning. The results in terms of participation and accuracy of the proposed systems have been encouraging. The best performing competitors obtained a third quartile of error of 1 m for the Smartphone Track and 0.5 m for the Foot-mounted IMU Track. While not running on physical systems, but only as algorithms, these results represent impressive achievements.Track 3 organizers were supported by the European Union’s Horizon 2020 Research and Innovation programme under the Marie Skłodowska Curie Grant 813278 (A-WEAR: A network for dynamic WEarable Applications with pRivacy constraints), MICROCEBUS (MICINN, ref. RTI2018-095168-B-C55, MCIU/AEI/FEDER UE), INSIGNIA (MICINN ref. PTQ2018-009981), and REPNIN+ (MICINN, ref. TEC2017-90808-REDT). We would like to thanks the UJI’s Library managers and employees for their support while collecting the required datasets for Track 3. Track 5 organizers were supported by JST-OPERA Program, Japan, under Grant JPMJOP1612. Track 7 organizers were supported by the Bavarian Ministry for Economic Affairs, Infrastructure, Transport and Technology through the Center for Analytics-Data-Applications (ADA-Center) within the framework of “BAYERN DIGITAL II. ” Team UMinho (Track 3) was supported by FCT—Fundação para a Ciência e Tecnologia within the R&D Units Project Scope under Grant UIDB/00319/2020, and the Ph.D. Fellowship under Grant PD/BD/137401/2018. Team YAI (Track 3) was supported by the Ministry of Science and Technology (MOST) of Taiwan under Grant MOST 109-2221-E-197-026. Team Indora (Track 3) was supported in part by the Slovak Grant Agency, Ministry of Education and Academy of Science, Slovakia, under Grant 1/0177/21, and in part by the Slovak Research and Development Agency under Contract APVV-15-0091. Team TJU (Track 3) was supported in part by the National Natural Science Foundation of China under Grant 61771338 and in part by the Tianjin Research Funding under Grant 18ZXRHSY00190. Team Next-Newbie Reckoners (Track 3) were supported by the Singapore Government through the Industry Alignment Fund—Industry Collaboration Projects Grant. This research was conducted at Singtel Cognitive and Artificial Intelligence Lab for Enterprises (SCALE@NTU), which is a collaboration between Singapore Telecommunications Limited (Singtel) and Nanyang Technological University (NTU). Team KawaguchiLab (Track 5) was supported by JSPS KAKENHI under Grant JP17H01762. Team WHU&AutoNavi (Track 6) was supported by the National Key Research and Development Program of China under Grant 2016YFB0502202. Team YAI (Tracks 6 and 7) was supported by the Ministry of Science and Technology (MOST) of Taiwan under Grant MOST 110-2634-F-155-001

    The design and intelligent control of an autonomous mobile robot

    Get PDF
    This thesis presents an investigation into the problems of exploration, map building and collision free navigation for intelligent autonomous mobile robots. The project began with an extensive review of currently available literature in the field of mobile robot research, which included intelligent control techniques and their application. It became clear that there was scope for further development with regard to map building and exploration in new and unstructured environments. Animals have an innate propensity to exhibit such abilities, and so the analogous use of artificial neural networks instead of actual neural systems was examined for use as a method of robot mapping. A simulated behaviour based mobile robot was used in conjunction with a growing cell structure neural network to map out new environments. When using the direct application of this algorithm, topological irregularities were observed to be the direct result of correlations within the input data stream. A modification to this basic system was shown to correct the problem, but further developments would be required to produce a generic solution. The mapping algorithms gained through this approach, although more similar to biological systems, are computationally inefficient in comparison to the methods which were subsequently developed. A novel mapping method was proposed based on the robot creating new location vectors, or nodes, when it exceeded a distance threshold from its mapped area. Network parameters were developed to monitor the state of growth of the network and aid the robot search process. In simulation, the combination of the novel mapping and search process were shown to be able to construct maps which could be subsequently used for collision free navigation. To develop greater insights into the control problem and to validate the simulation work the control structures were ported to a prototype mobile robot. The mobile robot was of circular construction, with a synchro-drive wheel configuration, and was equipped with eight ultrasonic distance sensors and an odometric positioning system. It was self-sufficient, incorporating all its power and computational resources. The experiments observed the effects of odometric drift and demonstrated methods of re-correction which were shown to be effective. Both the novel mapping method, and a new algorithm based on an exhaustive mesh search, were shown to be able to explore different environments and subsequently achieve collision free navigation. This was shown in all cases by monitoring the estimates in the positional error which remained within fixed bounds

    Off-Line Evaluation of Indoor Positioning Systems in Different Scenarios: The Experiences From IPIN 2020 Competition

    Get PDF
    Every year, for ten years now, the IPIN competition has aimed at evaluating real-world indoor localisation systems by testing them in a realistic environment, with realistic movement, using the EvAAL framework. The competition provided a unique overview of the state-of-the-art of systems, technologies, and methods for indoor positioning and navigation purposes. Through fair comparison of the performance achieved by each system, the competition was able to identify the most promising approaches and to pinpoint the most critical working conditions. In 2020, the competition included 5 diverse off-site off-site Tracks, each resembling real use cases and challenges for indoor positioning. The results in terms of participation and accuracy of the proposed systems have been encouraging. The best performing competitors obtained a third quartile of error of 1 m for the Smartphone Track and 0.5 m for the Foot-mounted IMU Track. While not running on physical systems, but only as algorithms, these results represent impressive achievements
    • …
    corecore