{"title":"Enhancing the Performance of Multi-Vehicle Navigation in Unstructured Environments using Hard Sample Mining","authors":"Yining Ma, Ang Li, Qadeer Khan, Daniel Cremers","doi":"arxiv-2409.05119","DOIUrl":null,"url":null,"abstract":"Contemporary research in autonomous driving has demonstrated tremendous\npotential in emulating the traits of human driving. However, they primarily\ncater to areas with well built road infrastructure and appropriate traffic\nmanagement systems. Therefore, in the absence of traffic signals or in\nunstructured environments, these self-driving algorithms are expected to fail.\nThis paper proposes a strategy for autonomously navigating multiple vehicles in\nclose proximity to their desired destinations without traffic rules in\nunstructured environments. Graphical Neural Networks (GNNs) have demonstrated good utility for this task\nof multi-vehicle control. Among the different alternatives of training GNNs,\nsupervised methods have proven to be most data-efficient, albeit require ground\ntruth labels. However, these labels may not always be available, particularly\nin unstructured environments without traffic regulations. Therefore, a tedious\noptimization process may be required to determine them while ensuring that the\nvehicles reach their desired destination and do not collide with each other or\nany obstacles. Therefore, in order to expedite the training process, it is\nessential to reduce the optimization time and select only those samples for\nlabeling that add most value to the training. In this paper, we propose a warm\nstart method that first uses a pre-trained model trained on a simpler subset of\ndata. Inference is then done on more complicated scenarios, to determine the\nhard samples wherein the model faces the greatest predicament. This is measured\nby the difficulty vehicles encounter in reaching their desired destination\nwithout collision. Experimental results demonstrate that mining for hard\nsamples in this manner reduces the requirement for supervised training data by\n10 fold. Videos and code can be found here:\n\\url{https://yininghase.github.io/multiagent-collision-mining/}.","PeriodicalId":501315,"journal":{"name":"arXiv - CS - Multiagent Systems","volume":"34 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Multiagent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.05119","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Contemporary research in autonomous driving has demonstrated tremendous
potential in emulating the traits of human driving. However, they primarily
cater to areas with well built road infrastructure and appropriate traffic
management systems. Therefore, in the absence of traffic signals or in
unstructured environments, these self-driving algorithms are expected to fail.
This paper proposes a strategy for autonomously navigating multiple vehicles in
close proximity to their desired destinations without traffic rules in
unstructured environments. Graphical Neural Networks (GNNs) have demonstrated good utility for this task
of multi-vehicle control. Among the different alternatives of training GNNs,
supervised methods have proven to be most data-efficient, albeit require ground
truth labels. However, these labels may not always be available, particularly
in unstructured environments without traffic regulations. Therefore, a tedious
optimization process may be required to determine them while ensuring that the
vehicles reach their desired destination and do not collide with each other or
any obstacles. Therefore, in order to expedite the training process, it is
essential to reduce the optimization time and select only those samples for
labeling that add most value to the training. In this paper, we propose a warm
start method that first uses a pre-trained model trained on a simpler subset of
data. Inference is then done on more complicated scenarios, to determine the
hard samples wherein the model faces the greatest predicament. This is measured
by the difficulty vehicles encounter in reaching their desired destination
without collision. Experimental results demonstrate that mining for hard
samples in this manner reduces the requirement for supervised training data by
10 fold. Videos and code can be found here:
\url{https://yininghase.github.io/multiagent-collision-mining/}.