Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
M
Multi-agent interaction planning
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Larkin Heintzman
Multi-agent interaction planning
Commits
3f79ced7
Commit
3f79ced7
authored
Dec 10, 2019
by
Larkin Heintzman
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Upload New File
parent
db895687
Pipeline
#25
canceled with stages
Changes
1
Pipelines
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
65 additions
and
0 deletions
+65
-0
generateSupergraphs.m
Matlab Code/generateSupergraphs.m
+65
-0
No files found.
Matlab Code/generateSupergraphs.m
0 → 100644
View file @
3f79ced7
function
supergraphs
=
generateSupergraphs
(
plcs
,
rho
,
parallelFlag
)
% GENERATESUPERGRAPHS builds the supergraphs per time slice of the
% trajectory sample. Note that the placements are simply treated as nodes
% without regard for trajectory index or agent number, mearly a proximity
% based graph
Tk
=
size
(
plcs
,
1
);
Tj
=
size
(
plcs
,
2
);
N
=
size
(
plcs
{
1
,
1
},
1
);
supergraphs
=
cell
(
Tk
,
1
);
% storage for all supergraphs
if
parallelFlag
parfor
s
=
1
:
Tk
% Generate supergraph incidence for this timeslice
G
=
zeros
(
N
*
Tj
);
for
i
=
1
:
N
for
j
=
1
:
Tj
for
k
=
1
:
N
if
(
k
==
i
)
continue
;
end
for
l
=
1
:
Tj
if
(
norm
(
plcs
{
s
,
j
}(
i
,:)
-
plcs
{
s
,
l
}(
k
,:))
<=
rho
)
idx1
=
(
i
-
1
)
*
Tj
+
j
;
idx2
=
(
k
-
1
)
*
Tj
+
l
;
G
(
idx1
,
idx2
)
=
1
;
end
end
end
end
end
supergraphs
{
s
}
=
G
;
% we just get the adjacency matrix now, for speed purposes
end
else
for
s
=
1
:
Tk
% Generate supergraph incidence for this timeslice
G
=
zeros
(
N
*
Tj
);
for
i
=
1
:
N
for
j
=
1
:
Tj
for
k
=
1
:
N
if
(
k
==
i
)
continue
;
end
for
l
=
1
:
Tj
if
(
norm
(
plcs
{
s
,
j
}(
i
,:)
-
plcs
{
s
,
l
}(
k
,:))
<=
rho
)
idx1
=
(
i
-
1
)
*
Tj
+
j
;
idx2
=
(
k
-
1
)
*
Tj
+
l
;
G
(
idx1
,
idx2
)
=
1
;
end
end
end
end
end
supergraphs
{
s
}
=
G
;
end
end
end
\ No newline at end of file
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment