Agile Satellite Mission Planning via Task Clustering and Double-Layer Tabu Algorithm

Satellite observation schedule is investigated in this paper. A mission planning algorithm of task clustering is proposed to improve the observation efficiency of agile satellite. The newly developed method can make the satellite observe more targets and therefore save observation resources. First,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer modeling in engineering & sciences Ročník 122; číslo 1; s. 235 - 257
Hlavní autoři: Zhao, Yanbin, Du, Bin, Li, Shuang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Henderson Tech Science Press 01.01.2020
Témata:
Agile Satellite
Algorithms
Clustering
Computer simulation
Economic models
Mission Planning
Satellite observation
Schedules
Tabu Algorithm
Task Clustering
ISSN:1526-1492, 1526-1506, 1526-1506
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Satellite observation schedule is investigated in this paper. A mission planning algorithm of task clustering is proposed to improve the observation efficiency of agile satellite. The newly developed method can make the satellite observe more targets and therefore save observation resources. First, for the densely distributed target points, a preprocessing scheme based on task clustering is proposed. The target points are clustered according to the distance condition. Second, the local observation path is generated by Tabu algorithm in the inner layer of cluster regions. Third, considering the scatter and cluster sets, the global observation path is obtained by adopting Tabu algorithm in the outer layer. Simulation results show that the algorithm can effectively reduce the task planning time of large-scale point targets while ensuring the optimal solution quality.
AbstractList Satellite observation schedule is investigated in this paper. A mission planning algorithm of task clustering is proposed to improve the observation efficiency of agile satellite. The newly developed method can make the satellite observe more targets and therefore save observation resources. First, for the densely distributed target points, a pre-processing scheme based on task clustering is proposed. The target points are clustered according to the distance condition. Second, the local observation path is generated by Tabu algorithm in the inner layer of cluster regions. Third, considering the scatter and cluster sets, the global observation path is obtained by adopting Tabu algorithm in the outer layer. Simulation results show that the algorithm can effectively reduce the task planning time of large-scale point targets while ensuring the optimal solution quality.
Satellite observation schedule is investigated in this paper. A mission planning algorithm of task clustering is proposed to improve the observation efficiency of agile satellite. The newly developed method can make the satellite observe more targets and therefore save observation resources. First, for the densely distributed target points, a preprocessing scheme based on task clustering is proposed. The target points are clustered according to the distance condition. Second, the local observation path is generated by Tabu algorithm in the inner layer of cluster regions. Third, considering the scatter and cluster sets, the global observation path is obtained by adopting Tabu algorithm in the outer layer. Simulation results show that the algorithm can effectively reduce the task planning time of large-scale point targets while ensuring the optimal solution quality.
Author Zhao, Yanbin
Du, Bin
Li, Shuang
Author_xml – sequence: 1
  givenname: Yanbin
  surname: Zhao
  fullname: Zhao, Yanbin
– sequence: 2
  givenname: Bin
  surname: Du
  fullname: Du, Bin
– sequence: 3
  givenname: Shuang
  surname: Li
  fullname: Li, Shuang
BookMark eNp9kcuP0zAQxi20SOzrzjES55TxI45zoypPqWhXonu2xqlTvLhOsZ2Vlr8epwWBkFhfZmR932_sby7IWRiDJeQlhQVnEsTrfm_TggGDBSho4Rk5pw2TNW1Anv3uRcdekIuU7gG45Ko7J5vlznlbfcFsvXfZVp9dSm4M1a3HEFzYVQ8Oqw2mb9XKTynbON9h2FZvx8l4W6_x0cYiMFO19Lsxuvx1f0WeD-iTvf5VL8nd-3eb1cd6ffPh02q5rnvRQq6t7Dk1Le-aoZEtHZQRRm0HQKRt0xojBimH8jlFmd22oJAXDZOGSpSmEYZfklcn7iGO3yebsr4fpxjKSM141zIphFRPqwSXqlFdV1TypOrjmFK0g-5dxlyiyBGd1xT0MWc956znnPUx52KEf4yH6PYYH5-yvDlZSpY2ZPzzoJwOf6vnQxk7NaXVGPNceUHc_Afh-iNlXvi8b_1QAIHOQAodlZoKUHprB5x81hmj3v3QqRB_Ak95r5U
CitedBy_id crossref_primary_10_32604_cmes_2022_018840
crossref_primary_10_32604_cmes_2023_025452
crossref_primary_10_1016_j_eswa_2025_128471
crossref_primary_10_1109_JSTARS_2022_3176951
crossref_primary_10_1109_JSYST_2021_3072122
ContentType Journal Article
Copyright Copyright Tech Science Press 2020
2020. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: Copyright Tech Science Press 2020
– notice: 2020. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID AAYXX
CITATION
7SC
7TB
8FD
FR3
JQ2
KR7
L7M
L~C
L~D
8FE
8FG
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
K7-
L6V
M7S
P5Z
P62
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOI 10.32604/cmes.2020.08070
DatabaseName CrossRef
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
ProQuest Computer Science Collection
Civil Engineering Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
ProQuest Technology Collection
ProQuest One
ProQuest Central
ProQuest Central Student
SciTech Premium Collection
Computer Science Database
ProQuest Engineering Collection
Engineering Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
Proquest Central Premium
ProQuest One Academic (New)
ProQuest Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DatabaseTitle CrossRef
Civil Engineering Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
Publicly Available Content Database
Computer Science Database
ProQuest Central Student
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Engineering Database
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList Civil Engineering Abstracts

Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1526-1506
EndPage 257
ExternalDocumentID 10_32604_cmes_2020_08070
tsp/cmes/2020/00000122/00000001/art00013
GroupedDBID -~X
AAFWJ
ACIWK
AFKRA
ALMA_UNASSIGNED_HOLDINGS
BENPR
CCPQU
EBS
EJD
F5P
IPNFZ
J9A
OK1
PIMPY
RTS
AAYXX
ABJCF
ADMLS
AFFHD
ARAPS
BGLVJ
CITATION
HCIFZ
K7-
M7S
PHGZM
PHGZT
PQGLB
PTHSS
RIG
7SC
7TB
8FD
FR3
JQ2
KR7
L7M
L~C
L~D
PUEGO
8FE
8FG
ABUWG
AZQEC
DWQXO
GNUQQ
L6V
P62
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c470t-e6c31b7395f5671f8b4b8df0aa1757bb4f66f326812ed708a31f826b16a6b54b3
IEDL.DBID M7S
ISICitedReferencesCount 24
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000509734200013&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1526-1492
1526-1506
IngestDate Sat Sep 06 07:30:40 EDT 2025
Sat Sep 06 07:29:48 EDT 2025
Sat Nov 29 05:50:20 EST 2025
Tue Nov 18 22:31:00 EST 2025
Thu Jan 27 13:03:25 EST 2022
Fri Nov 08 06:06:07 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c470t-e6c31b7395f5671f8b4b8df0aa1757bb4f66f326812ed708a31f826b16a6b54b3
Notes 1526-1492(20200115)122:1L.235;1-
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://www.proquest.com/docview/2397264468?pq-origsite=%requestingapplication%
PQID 2397264468
PQPubID 2048798
PageCount 23
ParticipantIDs ingenta_journals_tsp_cmes_2020_00000122_00000001_art00013
crossref_citationtrail_10_32604_cmes_2020_08070
crossref_primary_10_32604_cmes_2020_08070
ingenta_journals_ic_tsp_15261492_v122n1_20210916_1408_default_tar_gz_s13
proquest_journals_2343685899
proquest_journals_2397264468
PublicationCentury 2000
PublicationDate 2020-01-01
PublicationDateYYYYMMDD 2020-01-01
PublicationDate_xml – month: 01
  year: 2020
  text: 2020-01-01
  day: 01
PublicationDecade 2020
PublicationPlace Henderson
PublicationPlace_xml – name: Henderson
PublicationTitle Computer modeling in engineering & sciences
PublicationYear 2020
Publisher Tech Science Press
Publisher_xml – name: Tech Science Press
SSID ssj0036389
Score 2.4045236
Snippet Satellite observation schedule is investigated in this paper. A mission planning algorithm of task clustering is proposed to improve the observation efficiency...
SourceID proquest
crossref
ingenta
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 235
SubjectTerms Agile Satellite
Algorithms
Clustering
Computer simulation
Economic models
Mission Planning
Satellite observation
Schedules
Tabu Algorithm
Task Clustering
Title Agile Satellite Mission Planning via Task Clustering and Double-Layer Tabu Algorithm
URI https://www.ingentaconnect.com/content/tsp/cmes/2020/00000122/00000001/art00013
https://www.proquest.com/docview/2343685899
https://www.proquest.com/docview/2397264468
Volume 122
WOSCitedRecordID wos000509734200013&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1526-1506
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0036389
  issn: 1526-1492
  databaseCode: P5Z
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1526-1506
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0036389
  issn: 1526-1492
  databaseCode: K7-
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1526-1506
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0036389
  issn: 1526-1492
  databaseCode: M7S
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1526-1506
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0036389
  issn: 1526-1492
  databaseCode: BENPR
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 1526-1506
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0036389
  issn: 1526-1492
  databaseCode: PIMPY
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELZoy4EL5SkWysoHLhzMJo7jJCe0VK2KoKuILlLhYtmOs12Rpssmuwd-PTNOAosQvXCJovgpz3hmPON8Q8grl1gLck8wodFbZWTA0qzkLMqEDmyZaRGXPtlEMpull5dZ3jvcmv5a5SATvaAubiz6yCccFCcqb5m-XX1nmDUKo6t9Co09coAoCaG_uncxSOIItbHHS-WSwUmAd2FKMFgCMbHXDtG6efAGbCZMVbyjlv78r2lHPnulc3r4v9N9QO735iaddvzxkNxx9SNyOKRyoP3Ofkzm0wWIB3qhPUBn6-j5Eq_H1nRIakS3S03nuvlGj6sNgivgN10XFCxwUzn2UYPtDhXMhk6rBcykvbp-Qj6fnsyPz1ifcIFZkQQtc9JGocHQXRnLJCxTI0xalIHWYGQkxohSyhKWD4wCVyRBqiOow6UJpZYmFiZ6Svbrm9o9IzS0keaxlakTsShcAF1loggKUwL9TZiOyGRYb2V7NHJMilEpOJV4CimkkEIKKU-hEXn9q8WqQ-K4pe5ZT0LVb8lGLa1qm5VCZkBeUNuQ8zrERoiNKuEMFKSqcKXeVK1q9VotfqgmjEYk-6sr7GdnRB8h4bx7gVcFm97b1iNyNDDH78Y86kD_s-wfxQPjPL-9-AW5h8N37qAjst-uN-4luWu37bJZj8nBu5NZ_mlM9j4kbOy3BTzz-CuU5O_P8y8_Af0zEms
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3Nb9MwFLfGQGIXxqcoDPABDhxME8d1kgNC1WDq1K5Coki7GduxS0WWdU1aBH8UfyPv5QOKELvtwM2K7Zc4_vk9P3-8HyHPXWwt6D3BhMbVKiMDlqSesygVOrA-1WLga7KJeDpNTk_T9zvkR3cXBo9VdjqxVtTZucU18j4Hw4nGWyZvlhcMWaNwd7Wj0GhgMXbfvoLLVr4-fgv9-4Lzo3ezwxFrWQWYFXFQMSdtFBrcn_IDGYc-McIkmQ-0BksaGyO8lB4mNWD5XBYHiY6gDJcmlFqagTARyL1GrosoiXFcjWPWaf4IrX8dn5VLBp4Hb7ZFQVYg-vbMYXRwHryCORpSI2-ZwT_vUW3Zg9rIHe3_b7_nNrnVTqfpsMH_HbLjirtkv6OqoK3mukdmwzmoP_pB1wFIK0dPFnj8t6AdaRPdLDSd6fILPczXGDwCn-kio-BhmNyxiQbfBAqYNR3mc2h59fnsPvl4JW17QHaL88I9JDS0keYDKxMnBiJzAYhKRRZkxgO-TZj0SL_rX2XbaOtI-pEr8LpqRChEhEJEqBoRPfLyV41lE2nkkrKjFjKqVTmlWlhVlUuF4EPsqU3IeRFiJYz9KsHHCxKVOa_XeaUqvVLz76oMox5J_xKFcrbeWO8Acd4kIKlAqdW-Q48cdGD8XZlHDalBmv4juwPqo8uzn5Gbo9nJRE2Op-PHZA8_pVn6OiC71WrtnpAbdlMtytXTehBS8umqYf0TbdBpIA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Agile+Satellite+Mission+Planning+via+Task+Clustering+and+Double-Layer+Tabu+Algorithm&rft.jtitle=Computer+modeling+in+engineering+%26+sciences&rft.au=Zhao%2C+Yanbin&rft.au=Du%2C+Bin&rft.au=Li%2C+Shuang&rft.date=2020-01-01&rft.pub=Tech+Science+Press&rft.issn=1526-1492&rft.eissn=1526-1506&rft.volume=122&rft.issue=1&rft.spage=235&rft_id=info:doi/10.32604%2Fcmes.2020.08070&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1526-1492&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1526-1492&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1526-1492&client=summon