Oct. 6, 2022, 1:12 a.m. | Arundhati Banerjee, Ramina Ghods, Jeff Schneider

cs.LG updates on arXiv.org arxiv.org

Multi-agent active search requires autonomous agents to choose sensing
actions that efficiently locate targets. In a realistic setting, agents also
must consider the costs that their decisions incur. Previously proposed active
search algorithms simplify the problem by ignoring uncertainty in the agent's
environment, using myopic decision making, and/or overlooking costs. In this
paper, we introduce an online active search algorithm to detect targets in an
unknown environment by making adaptive cost-aware decisions regarding the
agent's actions. Our algorithm combines principles …

arxiv asynchronous cost search

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

Lead GNSS Data Scientist

@ Lurra Systems | Melbourne

Senior Machine Learning Engineer (MLOps)

@ Promaton | Remote, Europe

Vice President, Data Science, Marketplace

@ Xometry | North Bethesda, Maryland, Lexington, KY, Remote

Field Solutions Developer IV, Generative AI, Google Cloud

@ Google | Toronto, ON, Canada; Atlanta, GA, USA