Skip to content

noaslopez/FLIGHT-RADAR

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Safest flisht radar

This project joins two final projects, my final projet on the AI course offered by my university and the final project for the Building AI course offered by the University of Helsinki.

Summary

The aim of this repository is to stablish the safest route for a flight in order to avoid being recognized by radars. That way, it alows to implement two different heuristic functions and adapt the probability of being found and generates map showing the path choosen and the probability to be detected.

Background

Even if the problem might not be very clear and might seem silly this same logic can be applied to multiple aplications.

  1. Aircraft defense
  2. Actual driving applications which aim to find less dense routes or avoid radars to provide efficient routes for users
  3. Safe comercial flights (avoiding knwon areas of turbulence of eisting metheorologic threats)
  4. Emergency response in catastrophic areas where there is a clear image of affected areas
  5. Scientific research expeditions both planetary and on Earth

How is it used?

Functioning

Input:

Scenario configuration (map boundaries, radar locations, POIs) and detection tolerance

Setup:

Generates random radars with varying technical specifications across a geographic area

Detection Mapping:

Computes radar coverage probability for every location in the map

Path Planning:

Uses A* algorithm to find safe routes between Points of Interest (POIs) that avoid high-detection areas

Output:

Visualizes radar locations, detection fields, and the computed safe path

Timing considerations

This solution allows real-time interaction because of the heursitic search efficiency but also pre-route planning and continuous monitoring and adaptation

Data sources and AI methods

Some of the resources used (others than those seen during my university course) include:

  1. https://en.wikipedia.org/wiki/Chebyshev_distance
  2. https://web.archive.org/web/20120205043036/http://aigamedev.com/open/tutorial/symmetry-in-pathfinding/#3JumpPointSearch
  3. https://numpy.org/doc/stable/reference/generated/numpy.argmin.html

Challenges

There are multiple problems and limitations to the project, to my opinion the most important ones include:

  1. There is no automatic changes in route. That is, the image is static and it does not adapt to the movement of the user in real-time

  2. Again, for modifications the inputs myst be given and the code reruned, loosing very valuable time of action given its very specific usage in delicate operations.

What next?

The most logical step to follow next is to make the adaptation faster. Furthermore, I would particularly like to detect the position of the user and adapt the route according to the movement of the user making it mode adaptable and responsive to real-life interactions. However that would require of more complex tools.

Acknowledgments

The most important acknowledgements in this projects are:

  1. To my university which proposed this type of projects and encouraged me to persue them by giving me guidance and very strong technical foundations

  2. To the course Building AI which gave me the impulse to retake thses projects and develop them further on.

About

Development of a flight radar detection to ensure the saftest route for a flight using heuristic search in order to avoid detection areas based on a university project.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages