For this project you will be given a csv file with:
1. Location of Croc sightings over the years
2. Paths of croc travel between sightings
3. A draft python file to fill in the code, or replace with a related Java/C file (or enter pseudo code)
This exercise is based on created data, but the context is relevant. There are much less sighting than used in this exercise
Information: Crocodiles are often sighted around the Darwin area. Some of these are quite historic but they show where crocodiles have been breeding and feeding. They can travel down rivers, around bays and we have reason to believe they travel across areas of land marked with red trails. The exact route of these trails is not known, we are providing the best estimate given sightings of croc at different times in this area.
The red dots are sightings, usually associated with breeding locations, as the croc is less mobile at this time so more likely to be tracked. Sighting can be through finding fresh tracks or sightings of the animal in the location, which will include the number of sightings over a season.
Your first task is to process the data files and populate the variable locationList, with the data of the graph within the python file. You can calculate the travelling distance between two locations using the most direct path between two geo-locations, hence it is only an approximation of the actual distance between two locations.
Some extra points are provide as assumed stops on the transit routes of the croc when travelling between water courses. Otherwise points are joined along rivers and around the coast. Neighbours are only given in one direction the opposite direction is assumed to exist also.
Make sure your python/pseudo code file has the assumptions you have made in interpreting the clients’ requirements. This is so that if you code does not work as I expect, I can check if you code works according to your requirements you have assumed, then you will receive more marks than if your code works according to requirements that are not reasonable.
Note: Distance along a single path between adjacent points can be estimated as distance between points, the complete track on the map around shoreline etc is not needed
To test the possibility of blocking route between two locations, the rangers have to perform an exhaustive search on the path options between the two locations, along all direct paths in the same region of map. This will involve them moving between known sightings and along estuaries or shoreline to assess the ability for crocs to pass, or possible ways to block their passage.
Your task is to devise an algorithm to determine the minimum cost of performing an exhaustive search along all possible paths between two points where this cost is proportional to ground covered. Also give the single list of sequential point locations that were chosen to segment the route in order to obtain this minimum cost. If you find two routes from start point to the end point you need to include both in the optimum path. The cost is estimated just in units (how many units of work time required). Routine is computeCosting (location1, location 2).
4 pekerja bebas membida secara purata ₹1150/jam untuk pekerjaan ini
Hi, I have a great experienci in python, machine learning, deep learning, I did a lot of projects, like that before, I put a simple portfolio on my profile that you can see, and I am looking forward to working with you