TY - GEN
T1 - A heuristic approach to military transition problem
AU - Uçan, Ferhat
AU - Altilar, D. Turgay
PY - 2008
Y1 - 2008
N2 - Dynamic path planning problem, which is defined by finding the shortest distance movement from a starting point to a target destination in an environment that contains dynamic moveable obstacles, is a problem that is encountered in different forms in many fields. In military field, the safest transition of military units in shortest time is one of these forms. Transition problem is a very general problem. It can be used for vehicle routing in traffic, in military applications, in robotics, for determining the route between two points in urban transportation or for routing data packets in a network.
AB - Dynamic path planning problem, which is defined by finding the shortest distance movement from a starting point to a target destination in an environment that contains dynamic moveable obstacles, is a problem that is encountered in different forms in many fields. In military field, the safest transition of military units in shortest time is one of these forms. Transition problem is a very general problem. It can be used for vehicle routing in traffic, in military applications, in robotics, for determining the route between two points in urban transportation or for routing data packets in a network.
UR - http://www.scopus.com/inward/record.url?scp=58449129098&partnerID=8YFLogxK
U2 - 10.1109/ISCIS.2008.4717887
DO - 10.1109/ISCIS.2008.4717887
M3 - Conference contribution
AN - SCOPUS:58449129098
SN - 9781424428816
T3 - 2008 23rd International Symposium on Computer and Information Sciences, ISCIS 2008
BT - 2008 23rd International Symposium on Computer and Information Sciences, ISCIS 2008
T2 - 2008 23rd International Symposium on Computer and Information Sciences, ISCIS 2008
Y2 - 27 October 2008 through 29 October 2008
ER -
