DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | James Robert Morrison | - |
dc.contributor.advisor | 제임스모리슨 | - |
dc.contributor.author | Kim, Jong-Hoe | - |
dc.contributor.author | 김종회 | - |
dc.date.accessioned | 2015-04-23T06:33:41Z | - |
dc.date.available | 2015-04-23T06:33:41Z | - |
dc.date.issued | 2014 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=568499&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/196981 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 산업및시스템공학과, 2014.2, [ vii, 65 p. ] | - |
dc.description.abstract | The duration of missions that can be accomplished by unmanned aerial vehicles (UAVs) is limited by the battery or fuel capacity of its constituent UAVs. However, a system of UAVs that is supported by auto-mated refueling bases may support long term or even indefinite duration missions in a near autonomous mode. The UAVs can return to a base, replenish their resources and resume their duties. We develop a mixed integer linear program model to formalize the problem of scheduling such a system that includes multiple bases in disparate geographic locations that are shared between the UAVs. The system consists of a heterogeneous fleet of UAVs (each with different travel speed and distance capabilities), refuel stations and mission trajectories that must be followed by at least one UAV. A UAV may hand off the mission to another in order to return to base for a fuel recharge. For our persistent UAV observing service, we introduce new VRP that is distance constrained heterogeneous VRP with time window, multi-depot route and multiple trips. For the small size example problems, a state of-the-art MILP solver such as CPLEX is sufficient to create a schedule for the model. However, for the large size example problems or dynamic environment, CPLEX turned out that it is not sufficient to create a schedule due to the complexity of this problem. Therefore, to overcome the computation limit of CPLEX, RHTAm was developed and the results are compared with that of CPLEX. This is the first time that a generic scheduling model has been developed that allows mobile agents to return to service after refueling across multiple bases. In practice, the approach allows for a long-term mission to receive uninterrupted UAV service by successively handing off the task to replacement UAVs served by geographically distributed shared bases. A fleet of unmanned aerial vehicles (UAVs) supported by logistics infrastructure, such as automated service stations, may be capable of long-term persisten... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Vehicle routing problem | - |
dc.subject | 분기 한정법 | - |
dc.subject | 혼합 정수 계획법 | - |
dc.subject | 무인항공기 | - |
dc.subject | 차량 경로 문제 | - |
dc.subject | Branch and bound | - |
dc.subject | Unmanned aerial vehicle | - |
dc.subject | Mixed integer linear programming | - |
dc.title | Vehicle routing problem for persistent uav service | - |
dc.title.alternative | 지속적 무인 항공기 서비스를 위한 차량 경로 문제 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 568499/325007 | - |
dc.description.department | 한국과학기술원 : 산업및시스템공학과, | - |
dc.identifier.uid | 020105048 | - |
dc.contributor.localauthor | James Robert Morrison | - |
dc.contributor.localauthor | 제임스모리슨 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.