A Non-Convex Optimization Approach to Dynamic Coverage Problem of Multi-agent Systems in an Environment with Obstacles

MA Longbiao · HE Fenghua · WANG Long · LI Changxi · YAO Yu

Journal of Systems Science & Complexity ›› 2020, Vol. 33 ›› Issue (2) : 426-445.

PDF(752 KB)
中国科学院数学与系统科学研究院期刊网
JSSC
PDF(752 KB)
Journal of Systems Science & Complexity ›› 2020, Vol. 33 ›› Issue (2) : 426-445. DOI: 10.1007/s11424-020-8085-4

A Non-Convex Optimization Approach to Dynamic Coverage Problem of Multi-agent Systems in an Environment with Obstacles

    {{javascript:window.custom_author_en_index=0;}}
  • {{article.zuoZhe_EN}}
Author information +
History +

HeighLight

{{article.keyPoints_en}}

Abstract

{{article.zhaiyao_en}}

Key words

QR code of this article

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}. Journal of Systems Science and Complexity, 2020, 33(2): 426-445 https://doi.org/10.1007/s11424-020-8085-4

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

{{article.copyrightStatement_en}}
{{article.copyrightLicense_en}}
PDF(752 KB)

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉