Virual Oral Presentation Slide by Slide

IEEE/ICACT20220090 Slide.15        [Big Slide]       [YouTube]	Oral Presentation
	For dynamic coverage: In [10], the author proposed a polygon-based domain decomposition algorithm. This paper [11] analyzes the different methods in the literature concerning path planning problems involving dynamic coverage. In [12], the author proved that the problems of min-max and min-sum deployment delay targets are generally NP-complete. Lu J. et al. proposed a spiral layout algorithm to solve the random layout scheme of the general geometric disk coverage (GDC) problem.

[Go to Next Slide]

Select Voice: Virtual Oral Presentation!!