Skip to main navigation
Skip to search
Skip to main content

King Fahd University of Petroleum & Minerals Home

Help & FAQ Link opens in a new tab

Search content at King Fahd University of Petroleum & Minerals

Home
Profiles
Research units
Projects
Research output
Prizes
Student theses

ROBOTIC NETWORK SYSTEM WITH DYNAMIC MULTI-OBJECTIVE TASK ALLOCATION

Uthman Baroudi (Inventor)

King Fahd University of Petroleum & Minerals
Interdisciplinary Research Center for Smart Mobility and Logistics
Department of Computer Engineering

Research output: Patent

Overview

Original language	English
Patent number	US10525591
State	Published - 2020

Cite this

APA
Author
BIBTEX
Harvard
Standard
RIS
Vancouver

Baroudi, U. (2020). ROBOTIC NETWORK SYSTEM WITH DYNAMIC MULTI-OBJECTIVE TASK ALLOCATION. (Patent No. US10525591).

Baroudi, Uthman (Inventor). / ROBOTIC NETWORK SYSTEM WITH DYNAMIC MULTI-OBJECTIVE TASK ALLOCATION. Patent No.: US10525591.

@misc{cc92a33244dc43c0b5e5893fe6bd58e2,

title = "ROBOTIC NETWORK SYSTEM WITH DYNAMIC MULTI-OBJECTIVE TASK ALLOCATION",

author = "Uthman Baroudi",

year = "2020",

language = "English",

type = "Patent",

note = "US10525591",

}

Baroudi, U, ROBOTIC NETWORK SYSTEM WITH DYNAMIC MULTI-OBJECTIVE TASK ALLOCATION, Patent No. US10525591.

ROBOTIC NETWORK SYSTEM WITH DYNAMIC MULTI-OBJECTIVE TASK ALLOCATION. / Baroudi, Uthman (Inventor).
Patent No.: US10525591.

Research output: Patent

TY - PAT

T1 - ROBOTIC NETWORK SYSTEM WITH DYNAMIC MULTI-OBJECTIVE TASK ALLOCATION

AU - Baroudi, Uthman

PY - 2020

Y1 - 2020

M3 - Patent

M1 - US10525591

ER -

Baroudi U, inventor. ROBOTIC NETWORK SYSTEM WITH DYNAMIC MULTI-OBJECTIVE TASK ALLOCATION. US10525591. 2020.

Powered by Pure Link opens in a new tab, Scopus Link opens in a new tab & Elsevier Fingerprint Engine™ Link opens in a new tab

All content on this site: Copyright © 2026 King Fahd University of Petroleum & Minerals, its licensors, and contributors. All rights are reserved, including those for text and data mining, AI training, and similar technologies. For all open access content, the relevant licensing terms apply

We use cookies to help provide and enhance our service and tailor content. By continuing you agree to the use of cookies

Log in to Pure Link opens in a new tab

About web accessibility Link opens in a new tab

Report vulnerability Link opens in a new tab