scispace - formally typeset
J

Jared Coleman

Researcher at University of Southern California

Publications -  20
Citations -  22

Jared Coleman is an academic researcher from University of Southern California. The author has contributed to research in topics: Computer science & Engineering. The author has an hindex of 1, co-authored 3 publications receiving 3 citations. Previous affiliations of Jared Coleman include California State University, Long Beach.

Papers
More filters
Book ChapterDOI

The Pony Express Communication Problem

TL;DR: In this paper, the authors studied the Pony Express problem on the line, where n robots are arbitrarily deployed along a finite segment and the objective is to deliver the message in minimum time.

Measurements of neutrino oscillation parameters from the T2K experiment using $3.6\times10^{21}$ protons on target

T. Abe, +356 more
TL;DR: In this article , the T2K experiment presented new measurements of neutrino oscillation parameters using $19.7(16.3)-times10^{20}$ protons on target (POT) in (anti-)neutrino mode at the far detector (FD).
Proceedings ArticleDOI

Graph Convolutional Network-based Scheduler for Distributing Computation in the Internet of Robotic Things

TL;DR: In this article , the authors demonstrate how recent advancements in machine learning (in particular, in graph convolutional neural networks) can be leveraged to solve the task scheduling problem with decent performance and in much less time than traditional algorithms.
Proceedings ArticleDOI

Line Search for an Oblivious Moving Target

TL;DR: In this paper , the authors considered the case where the target is moving away from the origin and the robot is moving toward the origin, and the resulting competitive ratios were shown to be optimal when the target was moving towards the origin as well as when it was known and the target's initial distance was known.
Proceedings ArticleDOI

Delivery to Safety with Two Cooperating Robots

TL;DR: Online algorithms are provided which consider robots’ level of agreement on orientation as per OneAxis and NoAxis models, and knowledge of the boundary as per Visible, Discoverable, and Invisible and lower bounds for the competitive ratios of the online problems are provided.