中文
相关论文

相关论文: In-Route Task Selection in Crowdsourcing

200 篇论文

Several works related to spatial crowdsourcing have been proposed in the direction where the task executers are to perform the tasks within the stipulated deadlines. Though the deadlines are set, it may be a practical scenario that majority…

计算工程、金融与科学 · 计算机科学 2024-02-08 Naren Debnath , Sajal Mukhopadhyay , Fatos Xhafa

Spatial crowdsourcing (SC) engages large worker pools for location-based tasks, attracting growing research interest. However, prior SC task allocation approaches exhibit limitations in computational efficiency, balanced matching, and…

分布式、并行与集群计算 · 计算机科学 2023-10-20 Kun Li , Shengling Wang , Hongwei Shi , Xiuzhen Cheng , Minghui Xu

We study crowdsourcing quality management, that is, given worker responses to a set of tasks, our goal is to jointly estimate the true answers for the tasks, as well as the quality of the workers. Prior work on this problem relies primarily…

其他计算机科学 · 计算机科学 2015-03-03 Akash Das Sarma , Aditya Parameswaran , Jennifer Widom

In multimedia crowdsourcing, the requester's quality requirements and reward decisions will affect the workers' task selection strategies and the quality of their multimedia contributions. In this paper, we present a first study on how the…

计算机科学与博弈论 · 计算机科学 2019-04-26 Qi Shao , Man Hon Cheung , Jianwei Huang

Crowdsourcing is a common approach to rapidly annotate large volumes of data in machine learning applications. Typically, crowd workers are compensated with a flat rate based on an estimated completion time to meet a target hourly wage.…

人机交互 · 计算机科学 2024-12-03 Gordon Lim , Stefan Larson , Yu Huang , Kevin Leach

In this paper, we present a novel sequential paradigm for classification in crowdsourcing systems. Considering that workers are unreliable and they perform the tests with errors, we study the construction of decision trees so as to minimize…

机器学习 · 计算机科学 2018-05-03 Baocheng Geng , Qunwei Li , Pramod K. Varshney

We consider the problem of learning user preferences over robot trajectories for environments rich in objects and humans. This is challenging because the criterion defining a good trajectory varies with users, tasks and interactions in the…

机器人学 · 计算机科学 2016-01-06 Ashesh Jain , Debarghya Das , Jayesh K Gupta , Ashutosh Saxena

Facility location problems aim to identify the best locations to set up new services. Majority of the existing works typically assume that the users are static. However, there exists a wide array of services such as fuel stations, ATMs,…

数据库 · 计算机科学 2019-08-05 Shubhadip Mitra , Priya Saraf , Arnab Bhattacharya

There is a rapidly growing demand for itinerary planning in tourism but this task remains complex and difficult, especially when considering the need to optimize for queuing time and crowd levels for multiple users. This difficulty is…

人工智能 · 计算机科学 2020-06-11 Junhua Liu , Kristin L. Wood , Kwan Hui Lim

Crowdsourcing allows to instantly recruit workers on the web to annotate image, web page, or document databases. However, worker unreliability prevents taking a workers responses at face value. Thus, responses from multiple workers are…

信息检索 · 计算机科学 2013-07-31 Aditya Kurve , David J Miller , George Kesidis

The multi-path Traveling Salesman Problem with stochastic travel costs arises in hybrid vehicle routing applications designed for Smart City and City Logistics, where multiple paths exist between each pair of locations. Travel times along…

最优化与控制 · 数学 2026-05-15 Xiaochen Chou , Ludovica Di Marco , Enza Messina

The ridesharing problem is that given a set of trips, each trip consists of an individual, a vehicle of the individual and some requirements, select a subset of trips and use the vehicles of selected trips to deliver all individuals to…

数据结构与算法 · 计算机科学 2021-06-01 Qian-Ping Gu , Jiajian Leo Liang , Guochuan Zhang

The Travelling Salesman Problem (TSP) is a classical NP-hard problem and has broad applications in many disciplines and industries. In a large scale location-based services system, users issue TSP queries concurrently, where a TSP query is…

人工智能 · 计算机科学 2021-04-15 Kangfei Zhao , Shengcai Liu , Yu Rong , Jeffrey Xu Yu

We study the collective schedules problem, which consists in computing a one machine schedule of a set of tasks, knowing that a set of individuals (also called voters) have preferences regarding the order of the execution of the tasks. Our…

计算机科学与博弈论 · 计算机科学 2024-03-29 Martin Durand , Fanny Pascual

Informative path planning is an important and challenging problem in robotics that remains to be solved in a manner that allows for wide-spread implementation and real-world practical adoption. Among various reasons for this, one is the…

机器人学 · 计算机科学 2023-03-06 Brady Moon , Satrajit Chatterjee , Sebastian Scherer

To realize effective heterogeneous multi-robot teams, researchers must leverage individual robots' relative strengths and coordinate their individual behaviors. Specifically, heterogeneous multi-robot systems must answer three important…

机器人学 · 计算机科学 2021-08-06 Glen Neville , Andrew Messing , Harish Ravichandar , Seth Hutchinson , Sonia Chernova

Rapidly-exploring random trees (RRTs) are popular in motion planning because they find solutions efficiently to single-query problems. Optimal RRTs (RRT*s) extend RRTs to the problem of finding the optimal solution, but in doing so…

机器人学 · 计算机科学 2014-12-01 Jonathan D. Gammell , Siddhartha S. Srinivasa , Timothy D. Barfoot

In many real-world settings, problem instances that need to be solved are quite similar, and knowledge from previous optimization runs can potentially be utilized. We explore this for the Traveling Salesperson problem with time windows…

神经与进化计算 · 计算机科学 2026-04-17 Hy Nguyen , Thanh Nguyen Pham , Helen Yuliana Angmalisang , Liam Wigney , Frank Neumann

Linguistically diverse datasets are critical for training and evaluating robust machine learning systems, but data collection is a costly process that often requires experts. Crowdsourcing the process of paraphrase generation is an…

计算与语言 · 计算机科学 2020-06-05 Youxuan Jiang , Jonathan K. Kummerfeld , Walter S. Lasecki

We consider multi-agent transport task problems where, e.g. in a factory setting, items have to be delivered from a given start to a goal pose while the delivering robots need to avoid collisions with each other on the floor. We introduce a…

机器人学 · 计算机科学 2020-02-07 Christian Henkel , Jannik Abbenseth , Marc Toussaint