A heuristic approach to military transition problem

Ferhat Uçan; D. Turgay Altilar

doi:10.1109/ISCIS.2008.4717887

A heuristic approach to military transition problem

Ferhat Uçan^*, D. Turgay Altilar

^*Bu çalışma için yazışmadan sorumlu yazar

Bilgisayar Mühendisliği Bölümü

Istanbul Technical University

Araştırma sonucu: ???type-name??? › Konferans katkısı › bilirkişi

Özet

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.

Orijinal dil	İngilizce
Ana bilgisayar yayını başlığı	2008 23rd International Symposium on Computer and Information Sciences, ISCIS 2008
DOI'lar	https://doi.org/10.1109/ISCIS.2008.4717887
Yayın durumu	Yayınlandı - 2008
Etkinlik	2008 23rd International Symposium on Computer and Information Sciences, ISCIS 2008 - Istanbul, Turkey Süre: 27 Eki 2008 → 29 Eki 2008

Yayın serisi

Adı	2008 23rd International Symposium on Computer and Information Sciences, ISCIS 2008

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???	2008 23rd International Symposium on Computer and Information Sciences, ISCIS 2008
Ülke/Bölge	Turkey
Şehir	Istanbul
Periyot	27/10/08 → 29/10/08

BM SKH

Bu sonuç, aşağıdaki Sürdürülebilir Kalkınma Hedefine/Hedeflerine katkıda bulunur

Belgeye Erişim

10.1109/ISCIS.2008.4717887

Diğer Dosyalar ve Linkler

Link to publication in Scopus

Alıntı Yap

@inproceedings{b66191b5ab9a43ad903923b4829cf10f,

title = "A heuristic approach to military transition problem",

abstract = "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.",

author = "Ferhat U{\c c}an and Altilar, {D. Turgay}",

year = "2008",

doi = "10.1109/ISCIS.2008.4717887",

language = "English",

isbn = "9781424428816",

series = "2008 23rd International Symposium on Computer and Information Sciences, ISCIS 2008",

booktitle = "2008 23rd International Symposium on Computer and Information Sciences, ISCIS 2008",

note = "2008 23rd International Symposium on Computer and Information Sciences, ISCIS 2008 ; Conference date: 27-10-2008 Through 29-10-2008",

}

Uçan, F & Altilar, DT 2008, A heuristic approach to military transition problem. in 2008 23rd International Symposium on Computer and Information Sciences, ISCIS 2008., 4717887, 2008 23rd International Symposium on Computer and Information Sciences, ISCIS 2008, 2008 23rd International Symposium on Computer and Information Sciences, ISCIS 2008, Istanbul, Turkey, 27/10/08. https://doi.org/10.1109/ISCIS.2008.4717887

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 -

A heuristic approach to military transition problem

Özet

Yayın serisi

???event.eventtypes.event.conference???

BM SKH

Belgeye Erişim

Diğer Dosyalar ve Linkler

Parmak izi

Alıntı Yap