Mr. Bingyu Wang Profile

Bingyu Wang

at Texas A&M Univ

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 23 April 2020 Presentation + Paper

Connecting soldiers with relay robots in challenging environments

Bingyu Wang, Leonardo Bobadilla, Sivakumar Rathinam

Proceedings Volume 11413, 114130W (2020) https://doi.org/10.1117/12.2558667

KEYWORDS: Relays, Robots, Visibility, Algorithm development, Wireless communications, Infrared radiation, Visible radiation, Safety, Motion models

Read Abstract +

Real-time exchange of information amongst a team of soldiers is critical to the success of their mission in a battle field environment. The soldiers may not have a direct Line-of-Sight (LoS) between them in places with geographical separations and obstacles. A team of robots can be readily used in these scenarios to act as relays and facilitate real-time exchange of information between the soldiers. If there is no direct LoS between a pair of soldiers, the robots can be strategically placed and moved to act as a communication gateway between the soldiers. This article addresses the problem of placing a minimum number of robots in the environment such that any pair of soldiers can exchange information between each other either through direct LoS or through a series of relay robots. This problem is challenging, even in known environments, as the shape of the obstacles could be non-convex. We first show that this optimization problem is closely related to several NP-Hard problems. We then present fast heuristics that can find good feasible solutions to the problem. The heuristics sample the environment for potential robot locations and solve a connected set-cover problem to find a subset of locations that can provide the desired connectivity. The performance of the proposed heuristics is tested on a large number of problem instances generated by varying the number and placement of soldiers, and the shapes of the obstacles.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years