Searched for: +
(1 - 5 of 5)
document
Wilde, N. (author), Alonso-Mora, J. (author)
We study the problem of finding statistically distinct plans for stochastic task assignment problems such as online multi-robot pickup and delivery (MRPD) when facing multiple competing objectives. In many real-world settings robot fleets do not only need to fulfil delivery requests, but also have to consider auxiliary objectives such as...
journal article 2024
document
Botros, Alexander (author), Gilhuly, Barry (author), Wilde, N. (author), Sadeghi, Armin (author), Alonso-Mora, J. (author), Smith, Stephen L. (author)
We study the problem of deploying a fleet of mobile robots to service tasks that arrive stochastically over time and at random locations in an environment. This is known as the Dynamic Vehicle Routing Problem (DVRP) and requires robots to allocate incoming tasks among themselves and find an optimal sequence for each robot. State-of-the-art...
journal article 2023
document
Telikani, Akbar (author), Rudbardeh, Nima Esmi (author), Soleymanpour, Shiva (author), Shahbahrami, Asadollah (author), Shen, Jun (author), Gaydadjiev, G. (author), Hassanpour, Reza (author)
A problem with machine learning (ML) techniques for detecting intrusions in the Internet of Things (IoT) is that they are ineffective in the detection of low-frequency intrusions. In addition, as ML models are trained using specific attack categories, they cannot recognize unknown attacks. This article integrates strategies of cost-sensitive...
journal article 2023
document
Mukhopadhyay, Atri (author), Iosifidis, G. (author), Ruffini, Marco (author)
The development of Multi-access edge computing (MEC) has resulted from the requirement for supporting next generation mobile services, which need high capacity, high reliability and low latency. The key issue in such MEC architectures is to decide which edge nodes will be employed for serving the needs of the different end users. Here, we...
journal article 2022
document
Zhou, Y. (author)
Globalized dual heuristic programming (GDHP) is the most comprehensive adaptive critic design, which employs its critic to minimize the error with respect to both the cost-to-go and its derivatives simultaneously. Its implementation, however, confronts a dilemma of either introducing more computational load by explicitly calculating the...
journal article 2022
Searched for: +
(1 - 5 of 5)