中文
相关论文

相关论文: Landscape-Aware Bandit Hyper-Heuristics for Online…

200 篇论文

The world we live in is full of technology and with each passing day the advancement and usage of UAVs increases efficiently. As a result of the many application scenarios, there are some missions where the UAVs are vulnerable to external…

机器人学 · 计算机科学 2022-09-13 Jaskirat Singh , Neel Adwani , Harikumar Kandath , K. Madhava Krishna

We consider the problem where M agents collaboratively interact with an instance of a stochastic K-armed contextual bandit, where K>>M. The goal of the agents is to simultaneously minimize the cumulative regret over all the agents over a…

机器学习 · 计算机科学 2022-11-16 Jiabin Lin , Shana Moothedath

The rapid development of urban low-altitude unmanned aerial vehicle (UAV) economy poses new challenges for dynamic site selection of UAV landing points and supply stations. Traditional deep reinforcement learning methods face computational…

机器学习 · 计算机科学 2025-07-16 Jianing Zhi , Xinghua Li , Zidong Chen

A latent bandit problem is one in which the learning agent knows the arm reward distributions conditioned on an unknown discrete latent state. The primary goal of the agent is to identify the latent state, after which it can act optimally.…

机器学习 · 计算机科学 2020-06-17 Joey Hong , Branislav Kveton , Manzil Zaheer , Yinlam Chow , Amr Ahmed , Craig Boutilier

Motion planning is a critical component of intelligent unmanned systems, enabling their complex autonomous operations. However, current planning algorithms still face limitations in planning efficiency due to inflexible strategies and weak…

机器人学 · 计算机科学 2026-03-04 Yinghao Zhao , Chenguang Dai , Liang Lyu , Zhenchao Zhang , Chaozhen Lan , Hong Xie

The stochastic contextual bandit problem, which models the trade-off between exploration and exploitation, has many real applications, including recommender systems, online advertising and clinical trials. As many other machine learning…

机器学习 · 统计学 2022-06-14 Qin Ding , Yue Kang , Yi-Wei Liu , Thomas C. M. Lee , Cho-Jui Hsieh , James Sharpnack

Bandit algorithms have various application in safety-critical systems, where it is important to respect the system constraints that rely on the bandit's unknown parameters at every round. In this paper, we formulate a linear stochastic…

机器学习 · 计算机科学 2019-08-19 Sanae Amani , Mahnoosh Alizadeh , Christos Thrampoulidis

Routing is a crucial component in the design of Flying Ad-Hoc Networks (FANETs). State of the art routing solutions exploit the position of Unmanned Aerial Vehicles (UAVs) and their mobility information to determine the existence of links…

网络与互联网体系结构 · 计算机科学 2022-05-25 Anay Ajit Deshpande , Roberto Pereira , Federico Chiariotti , Adriano Pastore , Xavier Mestre , Andrea Zanella

Future vehicular networks require continuous connectivity to serve highly mobile users in urban environments. To mitigate the coverage limitations of fixed terrestrial macro base stations (MBS) under non line-of-sight (NLoS) conditions,…

网络与互联网体系结构 · 计算机科学 2026-02-19 Leonardo Spampinato , Lorenzo Mario Amorosa , Enrico Testi , Chiara Buratti , Riccardo Marini

Multi-armed bandit (MAB) is a class of online learning problems where a learning agent aims to maximize its expected cumulative reward while repeatedly selecting to pull arms with unknown reward distributions. We consider a scenario where…

机器学习 · 统计学 2019-01-25 Yang Cao , Zheng Wen , Branislav Kveton , Yao Xie

Haptic feedback can improve safety of teleoperated robots when situational awareness is limited or operators are inattentive. Standard potential field approaches increase haptic resistance as an obstacle is approached, which is desirable…

机器人学 · 计算机科学 2024-01-09 Ninghan Zhong , Kris Hauser

Our work is motivated by environmental monitoring tasks, where finding the global maxima (i.e., hotspot) of a spatially varying field is crucial. We investigate the problem of identifying the hotspot for fields that can be sensed using an…

机器人学 · 计算机科学 2021-03-24 Yoonchang Sung , Deeksha Dixit , Pratap Tokekar

We introduce contextual queueing bandits, a new context-aware framework for scheduling while simultaneously learning unknown service rates. Individual jobs carry heterogeneous contextual features, based on which the agent chooses a job and…

机器学习 · 计算机科学 2026-05-19 Seoungbin Bae , Garyeong Kang , Dabeen Lee

This paper studies optimal unmanned aerial vehicle (UAV) placement to ensure line-of-sight (LOS) communication and sensing for a cluster of ground users possibly in deep shadow, while the UAV maintains backhaul connectivity with a base…

系统与控制 · 电气工程与系统科学 2024-09-04 Yuanshuai Zheng , Junting Chen

We consider what we call the offline-to-online learning setting, focusing on stochastic finite-armed bandit problems. In offline-to-online learning, a learner starts with offline data collected from interactions with an unknown environment…

机器学习 · 计算机科学 2025-03-11 Flore Sentenac , Ilbin Lee , Csaba Szepesvari

This work describes the orchestration of a fleet of rotary-wing Unmanned Aerial Vehicles (UAVs) for harvesting prioritized traffic from random distributions of heterogeneous users with Multiple Input Multiple Output (MIMO) capabilities. In…

系统与控制 · 电气工程与系统科学 2024-04-02 Bharath Keshavamurthy , Nicolo Michelusi

Integration of reinforcement learning with unmanned aerial vehicles (UAVs) to achieve autonomous flight has been an active research area in recent years. An important part focuses on obstacle detection and avoidance for UAVs navigating…

人工智能 · 计算机科学 2021-03-12 Jeremy Roghair , Kyungtae Ko , Amir Ehsan Niaraki Asli , Ali Jannesari

We discuss surveillance with multiple unmanned aerial vehicles (UAV) that minimize idleness (the time between consecutive visits of sensing locations) and constrain latency (the time between capturing data at a sensing location and its…

机器人学 · 计算机科学 2021-01-12 Jürgen Scherer , Bernhard Rinner

This paper presents a finite-time analysis of the KL-UCB algorithm, an online, horizon-free index policy for stochastic bandit problems. We prove two distinct results: first, for arbitrary bounded rewards, the KL-UCB algorithm satisfies a…

统计理论 · 数学 2013-08-30 Aurélien Garivier , Olivier Cappé

Contextual multi-armed bandits (CMAB) have been widely used for learning to filter and prioritize information according to a user's interest. In this work, we analyze top-K ranking under the CMAB framework where the top-K arms are chosen…

机器学习 · 计算机科学 2022-01-31 Michael Rawson , Jade Freeman