2018 IEEE 11th International Conference on Cloud Computing (CLOUD) 2018
DOI: 10.1109/cloud.2018.00016
|View full text |Cite
|
Sign up to set email alerts
|

Latency-Aware Task Assignment and Scheduling in Collaborative Cloud Robotic Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
48
0
1

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 20 publications
(49 citation statements)
references
References 13 publications
0
48
0
1
Order By: Relevance
“…Based on the characteristics of optimization function such as convex (minimization) or concave (maximization) and the relation among the constraints, the choice of optimization method (linear programming, integer programming, non-linear programming, combinatorial, stochastic) is made in multi-agent cloud robotic system. For example, [142] linearizes a mixed-integer non-linear problem into an integer linear programming (ILP) model and reduces the computation and communication time during robotic application execution. Similarly, [142] allocates resources with minimal latency.…”
Section: E Mechanismmentioning
confidence: 99%
See 1 more Smart Citation
“…Based on the characteristics of optimization function such as convex (minimization) or concave (maximization) and the relation among the constraints, the choice of optimization method (linear programming, integer programming, non-linear programming, combinatorial, stochastic) is made in multi-agent cloud robotic system. For example, [142] linearizes a mixed-integer non-linear problem into an integer linear programming (ILP) model and reduces the computation and communication time during robotic application execution. Similarly, [142] allocates resources with minimal latency.…”
Section: E Mechanismmentioning
confidence: 99%
“…For example, [142] linearizes a mixed-integer non-linear problem into an integer linear programming (ILP) model and reduces the computation and communication time during robotic application execution. Similarly, [142] allocates resources with minimal latency. However, for complicated optimization problem, it is not always feasible to find the solution satisfying all the constraints, especially when the resource allocation is required to conduct in real-time.…”
Section: E Mechanismmentioning
confidence: 99%
“…Resolver el problema de localización es esencial para cualquier vehículo autónomo, para poder desempeñar de forma precisa el resto de las tareas necesarias, como la planificación y el control de movimientos. En primer lugar, la planificación de las tareas de inspección se puede llevar a cabo empleando técnicas de búsquedas en grafos [12], ampliamente conocidas y que proporcionan muy buenos resultados. Estas técnicas se basan en encontrar los mejores caminos entre las zonas, en este caso de inspección, que se deben visitar minimizando algunos factores como la distancia, la energía necesaria para realizar los movimientos, la maniobrabilidad del camino que une dichas zonas o cualquier otro criterio que permita establecer un coste.…”
Section: Vehículos De Inspección Autónomosunclassified
“…In static task assignment, [33] studied static algorithm allocation for a multi-robot system without considering cloud infrastructure and communication times. As far as we know, the only works that have addressed a similar problem are [31], and [32]. [32] solved the allocation problem by minimizing memory and time for a single robotic cloud system.…”
Section: Introductionmentioning
confidence: 99%
“…[32] solved the allocation problem by minimizing memory and time for a single robotic cloud system. [31] approached the assignment problem incompletely by considering only the minimum time and ignoring the memory parameter. Their method is also incomplete because it minimizes the total execution time without fully considering communications, as shown in [32].…”
Section: Introductionmentioning
confidence: 99%