Comparison of Stochastic Optimization Strategies in Multi-Robot Multi-Target Tracking Scenarios

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher
Full text 12,468 characters · extracted from preprint-html · click to expand
Comparison of Stochastic Optimization Strategies in Multi-Robot Multi-Target Tracking Scenarios | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Comparison of Stochastic Optimization Strategies in Multi-Robot Multi-Target Tracking Scenarios Pujie Xin, Philip Dames This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-3973390/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 05 Jun, 2025 Read the published version in Swarm Intelligence → Version 1 posted 11 You are reading this latest preprint version Abstract This paper conducts a comparative study of stochastic optimization strategies to enable multi-robot systems to search for and track an unknown number of targets. Each robot is equipped with a noisy sensor that has a limited Field of View (FoV). The robots use a distributed version of the Probability Hypothesis Density (PHD) filter to estimate both the number and states of the targets. This online target estimate is used by the different search strategies to select actions for each robot. We compare Lloyd's algorithm, a traditional method for distributed search, with four stochastic optimization techniques: Particle Swarm Optimization (PSO), Simulated Annealing (SA), Ant Colony Optimization (ACO), and Artificial Immune Systems (AIS). Each of the methods is adapted from the traditional case of finding a single global optimum to locate all the local maxima (\ie targets). We demonstrate through extensive simulations that these techniques offer superior coverage of the search area and more accurate target localization compared to the baseline Lloyd's algorithm. We also discuss the strengths and limitations of each method, assisting practitioners in the selection of the most appropriate strategy based on specific operational factors, such as the communication load in a multi-robot system. Multi-target tracking Stochastic optimization Distributed control Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 05 Jun, 2025 Read the published version in Swarm Intelligence → Version 1 posted Editorial decision: Revision requested 09 Jun, 2024 Reviews received at journal 08 Jun, 2024 Reviewers agreed at journal 08 Jun, 2024 Reviews received at journal 18 Apr, 2024 Reviews received at journal 28 Mar, 2024 Reviewers agreed at journal 18 Mar, 2024 Reviewers agreed at journal 18 Mar, 2024 Reviewers invited by journal 16 Mar, 2024 Editor assigned by journal 04 Mar, 2024 Submission checks completed at journal 20 Feb, 2024 First submitted to journal 20 Feb, 2024 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-3973390","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":274002127,"identity":"f5a6fb25-66d5-4801-b65a-a3e6b8b0a514","order_by":0,"name":"Pujie Xin","email":"","orcid":"","institution":"Temple University","correspondingAuthor":false,"prefix":"","firstName":"Pujie","middleName":"","lastName":"Xin","suffix":""},{"id":274002128,"identity":"be20738e-6aa5-4bd0-813a-fb4c34428da2","order_by":1,"name":"Philip Dames","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAxElEQVRIiWNgGAWjYFCCBBBhAyIYD4CIBiK1pEmASJK0HCZBizl78tMNH/6cr+MXO3vgwAcGG9kNBwhosex5ZnZzZtttCcnZeQkHZzCkGRPUYnAjwew2b8NtCYPbOQaHeRgOJxKhJf3b7T9/zknYg7T8YfhPjJYcs9sMbAckDKSBWoAhQFiLZc+bspu9bcmSM24D/dJjkGw8k5AWc/b0bTd+/LHj55+de/DBjwo72T6CDkMweVC5xGoZBaNgFIyCUYAFAADQXkzxb0iw5QAAAABJRU5ErkJggg==","orcid":"","institution":"Temple University","correspondingAuthor":true,"prefix":"","firstName":"Philip","middleName":"","lastName":"Dames","suffix":""}],"badges":[],"createdAt":"2024-02-20 17:06:29","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-3973390/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-3973390/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1007/s11721-025-00249-y","type":"published","date":"2025-06-05T15:57:25+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":84242686,"identity":"712bc08e-a607-474d-96d6-d47ef350cdfb","added_by":"auto","created_at":"2025-06-09 16:11:20","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1026307,"visible":true,"origin":"","legend":"","description":"","filename":"PSOPHD.pdf","url":"https://assets-eu.researchsquare.com/files/rs-3973390/v1_covered_a6bc5976-d851-4871-af9f-d590095aa2f5.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Comparison of Stochastic Optimization Strategies in Multi-Robot Multi-Target Tracking Scenarios","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"swarm-intelligence","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"swrm","sideBox":"Learn more about [Swarm Intelligence](http://link.springer.com/journal/11721)","snPcode":"11721","submissionUrl":"https://submission.nature.com/new-submission/11721/3","title":"Swarm Intelligence","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Multi-target tracking, Stochastic optimization, Distributed control","lastPublishedDoi":"10.21203/rs.3.rs-3973390/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-3973390/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"This paper conducts a comparative study of stochastic optimization strategies to enable multi-robot systems to search for and track an unknown number of targets. Each robot is equipped with a noisy sensor that has a limited Field of View (FoV). The robots use a distributed version of the Probability Hypothesis Density (PHD) filter to estimate both the number and states of the targets. This online target estimate is used by the different search strategies to select actions for each robot. We compare Lloyd's algorithm, a traditional method for distributed search, with four stochastic optimization techniques: Particle Swarm Optimization (PSO), Simulated Annealing (SA), Ant Colony Optimization (ACO), and Artificial Immune Systems (AIS). Each of the methods is adapted from the traditional case of finding a single global optimum to locate all the local maxima (\\ie targets). We demonstrate through extensive simulations that these techniques offer superior coverage of the search area and more accurate target localization compared to the baseline Lloyd's algorithm. We also discuss the strengths and limitations of each method, assisting practitioners in the selection of the most appropriate strategy based on specific operational factors, such as the communication load in a multi-robot system.","manuscriptTitle":"Comparison of Stochastic Optimization Strategies in Multi-Robot Multi-Target Tracking Scenarios","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-02-22 15:56:43","doi":"10.21203/rs.3.rs-3973390/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2024-06-09T15:20:51+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-06-08T12:57:26+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"15255747822059943745661986169591774703","date":"2024-06-08T12:07:27+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-04-18T19:09:50+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-03-28T05:34:01+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"23e5eec9-0693-45aa-b823-bca921011a48","date":"2024-03-18T16:54:06+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"d88cbb81-fac2-47c1-ba49-49d6a5a476cc","date":"2024-03-18T11:11:26+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2024-03-16T09:39:17+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2024-03-04T09:44:01+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2024-02-21T02:40:15+00:00","index":"","fulltext":""},{"type":"submitted","content":"Swarm Intelligence","date":"2024-02-20T16:31:53+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"swarm-intelligence","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"swrm","sideBox":"Learn more about [Swarm Intelligence](http://link.springer.com/journal/11721)","snPcode":"11721","submissionUrl":"https://submission.nature.com/new-submission/11721/3","title":"Swarm Intelligence","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"0861359c-5808-4e29-b2f5-a9c3ae39ab13","owner":[],"postedDate":"February 22nd, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[],"tags":[],"updatedAt":"2025-06-09T16:06:11+00:00","versionOfRecord":{"articleIdentity":"rs-3973390","link":"https://doi.org/10.1007/s11721-025-00249-y","journal":{"identity":"swarm-intelligence","isVorOnly":false,"title":"Swarm Intelligence"},"publishedOn":"2025-06-05 15:57:25","publishedOnDateReadable":"June 5th, 2025"},"versionCreatedAt":"2024-02-22 15:56:43","video":"","vorDoi":"10.1007/s11721-025-00249-y","vorDoiUrl":"https://doi.org/10.1007/s11721-025-00249-y","workflowStages":[]},"version":"v1","identity":"rs-3973390","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-3973390","identity":"rs-3973390","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2024) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-23T02:00:01.238055+00:00
License: CC-BY-4.0