Region Coverage Path Planning of Multiple Disconnected Convex Polygons Based on Simulated Annealing Algorithm

Research article (2021 IEEE 4th International Conference on Computer and Communication Engineering Technology (CCET), 2021) · cited 12× · AI/ML
Press Enter · cited answer in seconds

Region Coverage Path Planning of Multiple Disconnected Convex Polygons Based on Simulated Annealing Algorithm

Summary

Region Coverage Path Planning of Multiple Disconnected Convex Polygons Based on Simulated Annealing Algorithm is a scholarly article[1].

Key Facts

  • Region Coverage Path Planning of Multiple Disconnected Convex Polygons Based on Simulated Annealing Algorithm's instance of is recorded as scholarly article[2].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Region Coverage Path Planning of Multiple Disconnected Convex Polygons Based on Simulated Annealing Algorithm. Retrieved May 24, 2026, from https://4ort.xyz/entity/region-coverage-path-planning-of-multiple-disconnected-convex-polygons-based-on-simulated-annealing-algorithm
MLA “Region Coverage Path Planning of Multiple Disconnected Convex Polygons Based on Simulated Annealing Algorithm.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/region-coverage-path-planning-of-multiple-disconnected-convex-polygons-based-on-simulated-annealing-algorithm.
BibTeX @misc{4ortxyz_region-coverage-path-planning-of-multiple-disconnected-convex-polygons-based-on-simulated-annealing-algorithm_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Region Coverage Path Planning of Multiple Disconnected Convex Polygons Based on Simulated Annealing Algorithm}}, year = {2026}, url = {https://4ort.xyz/entity/region-coverage-path-planning-of-multiple-disconnected-convex-polygons-based-on-simulated-annealing-algorithm}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Region Coverage Path Planning of Multiple Disconnected Convex Polygons Based on Simulated Annealing Algorithm — https://4ort.xyz/entity/region-coverage-path-planning-of-multiple-disconnected-convex-polygons-based-on-simulated-annealing-algorithm (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/region-coverage-path-planning-of-multiple-disconnected-convex-polygons-based-on-simulated-annealing-algorithm · Last refreshed: