Automatic differentiation of non-holonomic fast marching for computing most threatening trajectories under sensors surveillance

We consider a two player game, where a first player has to install a surveillance system within an admissible region. The second player needs to enter the the monitored area, visit a target region, and then leave the area, while minimizing his overall probability of detection. Both players know the target region, and the second player knows the surveillance installation details.Optimal trajectories for the second player are computed using a recently developed variant of the fast marching algorithm, which takes into account curvature constraints modeling the second player vehicle maneuverability. The surveillance system optimization leverages a reverse-mode semi-automatic differentiation procedure, estimating the gradient of the value function related to the sensor location in time N log N

Generalized fast marching method for computing highest threatening trajectories with curvature constraints and detection ambiguities in distance and radial speed

Work presented at the 9th Conference on Curves and Surfaces, 2018, ArcachonWe present a recent numerical method devoted to computing curves that globally minimize an energy featuring both a data driven term, and a second order curvature penalizing term. Applications to image segmentation are discussed. We then describe in detail recent progress on radar network configuration, in which the optimal curves represent an opponent's trajectories

Aeronautical engineering: A continuing bibliography with indexes (supplement 203)

This bibliography lists 449 reports, articles and other documents introduced into the NASA scientific and technical information system in July 1986

Aeronautical engineering: A continuing bibliography with indexes (supplement 295)

This bibliography lists 581 reports, articles, and other documents introduced into the NASA Scientific and Technical Information System in Sep. 1993. Subject coverage includes: design, construction and testing of aircraft and aircraft engines; aircraft components, equipment, and systems; ground support systems; and theoretical and applied aspects of aerodynamics and general fluid dynamics

Aeronautical engineering: A continuing bibliography with indexes (supplement 291)

This bibliography lists 757 reports, articles, and other documents introduced into the NASA scientific and technical information system in May. 1993. Subject coverage includes: design, construction and testing of aircraft and aircraft engines; aircraft components, equipment, and systems; ground support systems; and theoretical and applied aspects of aerodynamics and general fluid dynamics

Aeronautical engineering: A continuing bibliography with indexes (supplement 201)

This bibliography lists 438 reports, articles, and other documents introduced into the NASA scientific and technical information system in May 1986

Self–organised multi agent system for search and rescue operations

Autonomous multi-agent systems perform inadequately in time critical missions, while they tend to explore exhaustively each location of the field in one phase with out selecting the pertinent strategy. This research aims to solve this problem by introducing a hierarchy of exploration strategies. Agents explore an unknown search terrain with complex topology in multiple predefined stages by performing pertinent strategies depending on their previous observations. Exploration inside unknown, cluttered, and confined environments is one of the main challenges for search and rescue robots inside collapsed buildings. In this regard we introduce our novel exploration algorithm for multi–agent system, that is able to perform a fast, fair, and thorough search as well as solving the multi–agent traffic congestion. Our simulations have been performed on different test environments in which the complexity of the search field has been defined by fractal dimension of Brownian movements. The exploration stages are depicted as defined arenas of National Institute of Standard and Technology (NIST). NIST introduced three scenarios of progressive difficulty: yellow, orange, and red. The main concentration of this research is on the red arena with the least structure and most challenging parts to robot nimbleness