scispace - formally typeset
Search or ask a question

Showing papers by "Ali A. Minai published in 2019"


Journal ArticleDOI
TL;DR: This work introduces a bioinspired behavioral dynamic model of free-flowing cooperative pick-and-place behaviors based on low-dimensional dynamical movement primitives and nonlinear action selection functions that can be successfully implemented as an artificial agent control architecture to produce effective and robust human-like behavior during human-agent interactions.
Abstract: Interactive or collaborative pick-and-place tasks occur during all kinds of daily activities, for example, when two or more individuals pass plates, glasses, and utensils back and forth between each other when setting a dinner table or loading a dishwasher together. In the near future, participation in these collaborative pick-and-place tasks could also include robotic assistants. However, for human-machine and human-robot interactions, interactive pick-and-place tasks present a unique set of challenges. A key challenge is that high-level task-representational algorithms and preplanned action or motor programs quickly become intractable, even for simple interaction scenarios. Here we address this challenge by introducing a bioinspired behavioral dynamic model of free-flowing cooperative pick-and-place behaviors based on low-dimensional dynamical movement primitives and nonlinear action selection functions. Further, we demonstrate that this model can be successfully implemented as an artificial agent control architecture to produce effective and robust human-like behavior during human-agent interactions. Participants were unable to explicitly detect whether they were working with an artificial (model controlled) agent or another human-coactor, further illustrating the potential effectiveness of the proposed modeling approach for developing systems of robust real/embodied human-robot interaction more generally.

12 citations


Proceedings ArticleDOI
14 Jul 2019
TL;DR: Very comparable results can be obtained using a much simpler linear classifier in word space, indicating that the use of words in partisan ways is not particularly complicated and that it has become steadily easier to infer partisan affiliation from political speeches in the United States.
Abstract: Politics is an area of broad interest to policy-makers, researchers, and the general public. The recent explosion in the availability of electronic data and advances in data analysis methods – including techniques from machine learning – have led to many studies attempting to extract political insight from this data. Speeches in the U.S. Congress represent an exceptionally rich dataset for this purpose, and these have been analyzed by many researchers using statistical and machine learning methods. In this paper, we analyze House of Representatives floor speeches from the 1981 - 2016 period, with the goal of inferring the partisan affiliation of the speakers from their use of words. Previous studies with sophisticated machine learning models has suggested that this task can be accomplished with an accuracy in the 55 to 80% range, depending on the year. In this paper, we show that, in fact, very comparable results can be obtained using a much simpler linear classifier in word space, indicating that the use of words in partisan ways is not particularly complicated. Our results also confirm that, over the period of study, it has become steadily easier to infer partisan affiliation from political speeches in the United States. Finally, we make some observations about specific terms that Republicans and Democrats have favored over the years in service of partisan expression.

9 citations


Proceedings ArticleDOI
11 Jun 2019
TL;DR: This paper addresses the problem of maximizing surveillance area coverage using multiple Unmanned Aerial Vehicles (UAVs) in an obstacle-laden and Global Positioning System (GPS)-denied environment using Cooperative Localization (CL) for state estimation and demonstrates the efficiency of the algorithm through extensive simulations.
Abstract: This paper addresses the problem of maximizing surveillance area coverage using multiple Unmanned Aerial Vehicles (UAVs) in an obstacle-laden and Global Positioning System (GPS)-denied environment. The UAVs should achieve this objective using the shortest possible routes while staying inside the designated search space and avoiding the obstacles. To attain a desired area coverage, we divide the NP-hard multi-objective optimization problem of planning optimal routes for all UAVs into 3 parts: (a) optimizing search area coverage, (b) performing obstacle avoidance, and (c) using Cooperative Localization (CL) for state estimation. We demonstrate the efficiency of our algorithm through extensive simulations.

3 citations