In recent years there has been an increased demand in use of multiple unmanned aerial vehicles (UAVs) for surveillance and material handling tasks in indoor environments. However, only a limited number of studies have been reported on UAV scheduling in an indoor 3D environment. This paper presents the indoor UAV scheduling problem and models it as a constraint satisfaction problem (CSP) to find a feasible solution in less computation time. A numerical example of the problem is presented to illustrate the proposed methodology.
CITATION STYLE
Park, Y., Khosiawan, Y., Moon, I., Janardhanan, M. N., & Nielsen, I. (2016). Scheduling system for multiple unmanned aerial vehicles in indoor environments using the CSP approach. In Smart Innovation, Systems and Technologies (Vol. 56, pp. 77–87). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-319-39630-9_7
Mendeley helps you to discover research relevant for your work.