I am trying to calculate and map least-cost paths connecting every single population of great crested newt that has been observed in a study area in North East Wales across a cost-weighted distance surface.
I have been trying to do this using Linkage Mapper 1.1.0, a set of Python scripts that automates the mapping of wildlife corridors (Linkage Mapper - CIRCUITSCAPE.ORG ). Unfortunately, I keep getting error messages that I am unable to make sense of, and the program's developer has informed me these are likely to be bugs that cannot currently be fixed.
With that in mind, I am trying to find an alternative approach. I am aware of the suite of Distance tools that are part of the Spatial Analyst extension in ArcGIS 10.3. What I don't know is how to use the Cost Path tool to automatically construct least-cost paths between a large number of data points (1471 species records in my case), rather than a single source and destination point. Ultimately, I want to end up with a map like the attached image. What is the best way to go about this? I have never used ModelBuilder but have a feeling this might be the solution? Is anyone aware of any other tools for wildlife corridor mapping that are freely available?
It's linked - click on the text "home range tool or program". At least, it works for me. Does the link go anywhere for you? If it only goes to the GeoNet homepage and not to the specific post, that apparently is a JIVE issue (the software that runs GeoNet).
Ah yes that's working now, thank you. I have actually already downloaded Conefor 2.6, one of the tools linked to in the post you mentioned. The reason I am running Linkage Mapper is a) to be able to produce a nice looking map of least-cost paths and b) to get a text file that quantifies cost-weighted distance between populations so I can use this as the distance file in Conefor (rather than simply using Euclidian distance).
Is there perhaps another, simpler way of getting a text file/CSV for cost-weighted distances between points across a resistance surface?
I've not done many Least Cost Path runs, so am not sure. However, there are some possibilities out there:
As you mentioned, one possibility is to use Modelbuilder to batch process all the individual runs. One would employ an Iterator in Modelbuilder to loop through all the populations by Least Cost Paths. You'd have to play with Modelbuilder a bit to figure it out - it's not hard to learn, but does have its quirks.
If you are skilled at programming, another option is to use Python to do the batching. This is a more elegant and efficient way to do it, but requires more skills.
Chris, I am still stuck on the need to run 1471 individual cases. One would need to know more about the 'from' locations and the 'to' locations and the intervening landscape to see if the problem could be generalized more.
Thanks Mervyn, I ended up using LinkageMapper after all (which is part of the Circuitscape project as far as I'm aware). I wasn't aware of the new Cost Connectivity tool, this sounds incredibly useful for the type of work that I do. I will make sure to update our organisation's version of ArcMap (currently still on 10.3.1).
