Gopal Gopal Gopal Gopal Gopal

Demo Publications

font

Filter

2009

Ramchurn, Sarvapali D.; Mezzetti, Claudio; Giovannucci, Andrea; Rodriguez, Juan A.; Dash, Rajdeep K.; Jennings, Nicholas R.

Trust-based mechanisms for robust and efficient task allocation in the presence of execution uncertainty Journal Article

In: Journal of Artificial Intelligence Research, vol. 35, pp. 1–41, 2009.

Abstract | Links | BibTeX | Tags: mechanism design, optimisation, Trust, uncertainty

@article{eps267288,

title = {Trust-based mechanisms for robust and efficient task allocation in the presence of execution uncertainty},

author = {Sarvapali D. Ramchurn and Claudio Mezzetti and Andrea Giovannucci and Juan A. Rodriguez and Rajdeep K. Dash and Nicholas R. Jennings},

url = {http://eprints.soton.ac.uk/267288/},

year  = {2009},

date = {2009-01-01},

journal = {Journal of Artificial Intelligence Research},

volume = {35},

pages = {1–41},

abstract = {Vickrey-Clarke-Groves (VCG) mechanisms are often used to allocate tasks to selfish and rational agents. VCG mechanisms are incentive-compatible, direct mechanisms that are efficient (i.e. maximise social utility) and individually rational (i.e. agents prefer to join rather than opt out). However, an important assumption of these mechanisms is that the agents will always successfully complete their allocated tasks. Clearly, this assumption is unrealistic in many real-world applications where agents can, and often do, fail in their endeavours. Moreover, whether an agent is deemed to have failed may be perceived differently by different agents. Such subjective perceptions about an agent's probability of succeeding at a given task are often captured and reasoned about using the notion of trust. Given this background, in this paper we investigate the design of novel mechanisms that take into account the trust between agents when allocating tasks. Specifically, we develop a new class of mechanisms, called trust-based mechanisms, that can take into account multiple subjective measures of the probability of an agent succeeding at a given task and produce allocations that maximise social utility, whilst ensuring that no agent obtains a negative utility. We then show that such mechanisms pose a challenging new combinatorial optimisation problem (that is NP-complete), devise a novel representation for solving the problem, and develop an effective integer programming solution (that can solve instances with about 2x10^ 5 possible allocations in 40 seconds).},

keywords = {mechanism design, optimisation, Trust, uncertainty},

pubstate = {published},

tppubtype = {article}

}

Ramchurn, Sarvapali D.; Mezzetti, Claudio; Giovannucci, Andrea; Rodriguez, Juan A.; Dash, Rajdeep K.; Jennings, Nicholas R.

Trust-based mechanisms for robust and efficient task allocation in the presence of execution uncertainty Journal Article

In: Journal of Artificial Intelligence Research, vol. 35, pp. 1–41, 2009.

Abstract | Links | BibTeX

@article{eps267288,

title = {Trust-based mechanisms for robust and efficient task allocation in the presence of execution uncertainty},

author = {Sarvapali D. Ramchurn and Claudio Mezzetti and Andrea Giovannucci and Juan A. Rodriguez and Rajdeep K. Dash and Nicholas R. Jennings},

url = {http://eprints.soton.ac.uk/267288/},

year  = {2009},

date = {2009-01-01},

journal = {Journal of Artificial Intelligence Research},

volume = {35},

pages = {1–41},

abstract = {Vickrey-Clarke-Groves (VCG) mechanisms are often used to allocate tasks to selfish and rational agents. VCG mechanisms are incentive-compatible, direct mechanisms that are efficient (i.e. maximise social utility) and individually rational (i.e. agents prefer to join rather than opt out). However, an important assumption of these mechanisms is that the agents will always successfully complete their allocated tasks. Clearly, this assumption is unrealistic in many real-world applications where agents can, and often do, fail in their endeavours. Moreover, whether an agent is deemed to have failed may be perceived differently by different agents. Such subjective perceptions about an agent's probability of succeeding at a given task are often captured and reasoned about using the notion of trust. Given this background, in this paper we investigate the design of novel mechanisms that take into account the trust between agents when allocating tasks. Specifically, we develop a new class of mechanisms, called trust-based mechanisms, that can take into account multiple subjective measures of the probability of an agent succeeding at a given task and produce allocations that maximise social utility, whilst ensuring that no agent obtains a negative utility. We then show that such mechanisms pose a challenging new combinatorial optimisation problem (that is NP-complete), devise a novel representation for solving the problem, and develop an effective integer programming solution (that can solve instances with about 2x10^ 5 possible allocations in 40 seconds).},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

Show all

2009

Ramchurn, Sarvapali D.; Mezzetti, Claudio; Giovannucci, Andrea; Rodriguez, Juan A.; Dash, Rajdeep K.; Jennings, Nicholas R.

Trust-based mechanisms for robust and efficient task allocation in the presence of execution uncertainty Journal Article

In: Journal of Artificial Intelligence Research, vol. 35, pp. 1–41, 2009.

Abstract | Links | BibTeX | Tags: mechanism design, optimisation, Trust, uncertainty

@article{eps267288,

title = {Trust-based mechanisms for robust and efficient task allocation in the presence of execution uncertainty},

author = {Sarvapali D. Ramchurn and Claudio Mezzetti and Andrea Giovannucci and Juan A. Rodriguez and Rajdeep K. Dash and Nicholas R. Jennings},

url = {http://eprints.soton.ac.uk/267288/},

year  = {2009},

date = {2009-01-01},

journal = {Journal of Artificial Intelligence Research},

volume = {35},

pages = {1–41},

abstract = {Vickrey-Clarke-Groves (VCG) mechanisms are often used to allocate tasks to selfish and rational agents. VCG mechanisms are incentive-compatible, direct mechanisms that are efficient (i.e. maximise social utility) and individually rational (i.e. agents prefer to join rather than opt out). However, an important assumption of these mechanisms is that the agents will always successfully complete their allocated tasks. Clearly, this assumption is unrealistic in many real-world applications where agents can, and often do, fail in their endeavours. Moreover, whether an agent is deemed to have failed may be perceived differently by different agents. Such subjective perceptions about an agent's probability of succeeding at a given task are often captured and reasoned about using the notion of trust. Given this background, in this paper we investigate the design of novel mechanisms that take into account the trust between agents when allocating tasks. Specifically, we develop a new class of mechanisms, called trust-based mechanisms, that can take into account multiple subjective measures of the probability of an agent succeeding at a given task and produce allocations that maximise social utility, whilst ensuring that no agent obtains a negative utility. We then show that such mechanisms pose a challenging new combinatorial optimisation problem (that is NP-complete), devise a novel representation for solving the problem, and develop an effective integer programming solution (that can solve instances with about 2x10^ 5 possible allocations in 40 seconds).},

keywords = {mechanism design, optimisation, Trust, uncertainty},

pubstate = {published},

tppubtype = {article}

}

Ramchurn, Sarvapali D.; Mezzetti, Claudio; Giovannucci, Andrea; Rodriguez, Juan A.; Dash, Rajdeep K.; Jennings, Nicholas R.

Trust-based mechanisms for robust and efficient task allocation in the presence of execution uncertainty Journal Article

In: Journal of Artificial Intelligence Research, vol. 35, pp. 1–41, 2009.

Abstract | Links | BibTeX

@article{eps267288,

title = {Trust-based mechanisms for robust and efficient task allocation in the presence of execution uncertainty},

author = {Sarvapali D. Ramchurn and Claudio Mezzetti and Andrea Giovannucci and Juan A. Rodriguez and Rajdeep K. Dash and Nicholas R. Jennings},

url = {http://eprints.soton.ac.uk/267288/},

year  = {2009},

date = {2009-01-01},

journal = {Journal of Artificial Intelligence Research},

volume = {35},

pages = {1–41},

abstract = {Vickrey-Clarke-Groves (VCG) mechanisms are often used to allocate tasks to selfish and rational agents. VCG mechanisms are incentive-compatible, direct mechanisms that are efficient (i.e. maximise social utility) and individually rational (i.e. agents prefer to join rather than opt out). However, an important assumption of these mechanisms is that the agents will always successfully complete their allocated tasks. Clearly, this assumption is unrealistic in many real-world applications where agents can, and often do, fail in their endeavours. Moreover, whether an agent is deemed to have failed may be perceived differently by different agents. Such subjective perceptions about an agent's probability of succeeding at a given task are often captured and reasoned about using the notion of trust. Given this background, in this paper we investigate the design of novel mechanisms that take into account the trust between agents when allocating tasks. Specifically, we develop a new class of mechanisms, called trust-based mechanisms, that can take into account multiple subjective measures of the probability of an agent succeeding at a given task and produce allocations that maximise social utility, whilst ensuring that no agent obtains a negative utility. We then show that such mechanisms pose a challenging new combinatorial optimisation problem (that is NP-complete), devise a novel representation for solving the problem, and develop an effective integer programming solution (that can solve instances with about 2x10^ 5 possible allocations in 40 seconds).},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

Follow me on:

Selected Publications

Multi-agent signal-less intersection management with dynamic platoon formation

No data available.

https://eprints.soton.ac.uk/478647/

@inproceedings{soton478647,
title = {Multi-agent signal-less intersection management with dynamic platoon formation},
author = {Phuriwat Worrawichaipat and Enrico Gerding and Ioannis Kaparias and Sarvapali Ramchurn},
url = {https://eprints.soton.ac.uk/478647/},
year = {2023},
date = {2023-05-01},
booktitle = {22nd International Conference on Autonomous Agents and Multiagent Systems (29/05/23 - 02/06/23)},
pages = {1542--1550},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}

AI Foundation Models: initial review, CMA Consultation, TAS Hub Response

No data available.

https://eprints.soton.ac.uk/477553/

@misc{soton477553,
title = {AI Foundation Models: initial review, CMA Consultation, TAS Hub Response},
author = {Joshua Krook and Derek McAuley and Stuart Anderson and John Downer and Peter Winter and Sarvapali D Ramchurn},
url = {https://eprints.soton.ac.uk/477553/},
year = {2023},
date = {2023-06-01},
publisher = {University of Southampton},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}

The effect of data visualisation quality and task density on human-swarm interaction

No data available.

https://eprints.soton.ac.uk/479970/

@inproceedings{soton479970,
title = {The effect of data visualisation quality and task density on human-swarm interaction},
author = {Ayodeji Abioye and Mohammad Naiseh and William Hunt and Jediah R Clark and Sarvapali D Ramchurn and Mohammad Soorati},
url = {https://eprints.soton.ac.uk/479970/},
year = {2023},
date = {2023-06-01},
booktitle = {Proceedings of the 2023 32nd IEEE International Conference on Robot and Human Interactive Communication (RO-MAN)},
publisher = {IEEE},
abstract = {Despite the advantages of having robot swarms, human supervision is required for real-world applications. The performance of the human-swarm system depends on several factors including the data availability for the human operators. In this paper, we study the human factors aspect of the human-swarm interaction and investigate how having access to high-quality data can affect the performance of the human-swarm system - the number of tasks completed and the human trust level in operation. We designed an experiment where a human operator is tasked to operate a swarm to identify casualties in an area within a given time period. One group of operators had the option to request high-quality pictures while the other group had to base their decision on the available low-quality images. We performed a user study with 120 participants and recorded their success rate (directly logged via the simulation platform) as well as their workload and trust level (measured through a questionnaire after completing a human-swarm scenario). The findings from our study indicated that the group granted access to high-quality data exhibited an increased workload and placed greater trust in the swarm, thus confirming our initial hypothesis. However, we also found that the number of accurately identified casualties did not significantly vary between the two groups, suggesting that data quality had no impact on the successful completion of tasks.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}

Demonstrating performance benefits of human-swarm teaming

Autonomous swarms of robots can bring robustness, scalability and adaptability to safety-critical tasks such as search and rescue but their application is still very limited. Using semi-autonomous swarms with human control can bring robot swarms to real-world applications. Human operators can define goals for the swarm, monitor their performance and interfere with, or overrule, the decisions and behaviour. We present the "Human And Robot Interactive Swarm'' simulator (HARIS) that allows multi-user interaction with a robot swarm and facilitates qualitative and quantitative user studies through simulation of robot swarms completing tasks, from package delivery to search and rescue, with varying levels of human control. In this demonstration, we showcase the simulator by using it to study the performance gain offered by maintaining a "human-in-the-loop'' over a fully autonomous system as an example. This is illustrated in the context of search and rescue, with an autonomous allocation of resources to those in need.

https://eprints.soton.ac.uk/479903/

@inproceedings{soton479903,
title = {Demonstrating performance benefits of human-swarm teaming},
author = {William Hunt and Jack Ryan and Ayodeji O Abioye and Sarvapali D Ramchurn and Mohammad D Soorati},
url = {https://eprints.soton.ac.uk/479903/},
year = {2023},
date = {2023-05-01},
booktitle = {Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems},
pages = {3062--3064},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)},
abstract = {Autonomous swarms of robots can bring robustness, scalability and adaptability to safety-critical tasks such as search and rescue but their application is still very limited. Using semi-autonomous swarms with human control can bring robot swarms to real-world applications. Human operators can define goals for the swarm, monitor their performance and interfere with, or overrule, the decisions and behaviour. We present the "Human And Robot Interactive Swarm'' simulator (HARIS) that allows multi-user interaction with a robot swarm and facilitates qualitative and quantitative user studies through simulation of robot swarms completing tasks, from package delivery to search and rescue, with varying levels of human control. In this demonstration, we showcase the simulator by using it to study the performance gain offered by maintaining a "human-in-the-loop'' over a fully autonomous system as an example. This is illustrated in the context of search and rescue, with an autonomous allocation of resources to those in need.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}

2009

Ramchurn, Sarvapali D.; Mezzetti, Claudio; Giovannucci, Andrea; Rodriguez, Juan A.; Dash, Rajdeep K.; Jennings, Nicholas R.

Trust-based mechanisms for robust and efficient task allocation in the presence of execution uncertainty Journal Article

In: Journal of Artificial Intelligence Research, vol. 35, pp. 1–41, 2009.

Abstract | Links | BibTeX

@article{eps267288,

title = {Trust-based mechanisms for robust and efficient task allocation in the presence of execution uncertainty},

author = {Sarvapali D. Ramchurn and Claudio Mezzetti and Andrea Giovannucci and Juan A. Rodriguez and Rajdeep K. Dash and Nicholas R. Jennings},

url = {http://eprints.soton.ac.uk/267288/},

year  = {2009},

date = {2009-01-01},

journal = {Journal of Artificial Intelligence Research},

volume = {35},

pages = {1–41},

abstract = {Vickrey-Clarke-Groves (VCG) mechanisms are often used to allocate tasks to selfish and rational agents. VCG mechanisms are incentive-compatible, direct mechanisms that are efficient (i.e. maximise social utility) and individually rational (i.e. agents prefer to join rather than opt out). However, an important assumption of these mechanisms is that the agents will always successfully complete their allocated tasks. Clearly, this assumption is unrealistic in many real-world applications where agents can, and often do, fail in their endeavours. Moreover, whether an agent is deemed to have failed may be perceived differently by different agents. Such subjective perceptions about an agent's probability of succeeding at a given task are often captured and reasoned about using the notion of trust. Given this background, in this paper we investigate the design of novel mechanisms that take into account the trust between agents when allocating tasks. Specifically, we develop a new class of mechanisms, called trust-based mechanisms, that can take into account multiple subjective measures of the probability of an agent succeeding at a given task and produce allocations that maximise social utility, whilst ensuring that no agent obtains a negative utility. We then show that such mechanisms pose a challenging new combinatorial optimisation problem (that is NP-complete), devise a novel representation for solving the problem, and develop an effective integer programming solution (that can solve instances with about 2x10^ 5 possible allocations in 40 seconds).},

keywords = {},

pubstate = {published},

tppubtype = {article}

}