plateform stringclasses 1
value | repo_name stringlengths 13 113 | name stringlengths 3 74 | ext stringclasses 1
value | path stringlengths 12 229 | size int64 23 843k | source_encoding stringclasses 9
values | md5 stringlengths 32 32 | text stringlengths 23 843k |
|---|---|---|---|---|---|---|---|---|
github | danielrherber/pm-architectures-project-master | PMA_EX_A261919.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A261919.m | 1,773 | utf_8 | 95a08082aa97ec55ca8b085fdbe978a4 | %--------------------------------------------------------------------------
% PMA_EX_A261919
% A261919, number of n-node unlabeled graphs without isolated nodes or
% endpoints (i.e., no nodes of degree 0 or 1)
% 0, 0, 1, 3, 11, 62, 510, 7459, 197867, 9808968, 902893994, ...
%--------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A192517.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A192517.m | 2,639 | utf_8 | a119702694d669ecddd0f29346bb9dbb | %--------------------------------------------------------------------------
% PMA_EX_A192517
% A192517, Table read by antidiagonals: T(q,p) = number of multigraphs with
% p vertices and q edges, with no loops allowed (p >= 1, q >= 0)
% 1 1 1 1 1 1 1 1 1 1
% 0 1 1 1 1 ... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A054921.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A054921.m | 1,682 | utf_8 | 1894f4c910b8b869cd9aed408ead892b | %--------------------------------------------------------------------------
% PMA_EX_A054921
% A054921, number of connected unlabeled symmetric relations (graphs with
% loops) having n nodes
% 2, 3, 10, 50, 354, 3883, 67994, 2038236, 109141344, 10693855251, ...
%---------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A191970.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A191970.m | 1,669 | utf_8 | f89caa22e5eb2a867696e93c147decee | %--------------------------------------------------------------------------
% PMA_EX_A191970
% A191970, number of connected graphs with n edges with loops allowed
% 2, 2, 6, 12, 33, 93, 287, 940, 3309, 12183, 47133, 190061, 796405, ...
%--------------------------------------------------------------------------
%
%-----... |
github | danielrherber/pm-architectures-project-master | PMA_EX_IDETC2016_SuspensionConstraints.m | .m | pm-architectures-project-master/examples/idetc201660212/PMA_EX_IDETC2016_SuspensionConstraints.m | 1,332 | utf_8 | cad944c7d48bdc6fb07a4da77a919d6f | %--------------------------------------------------------------------------
% PMA_EX_IDETC2016_SuspensionConstraints.m
% Additional network structure constraints for Case Study 3 in the paper
% below
%--------------------------------------------------------------------------
% http://systemdesign.illinois.edu/publicati... |
github | danielrherber/pm-architectures-project-master | PMA_EX_STRUCT_Bayrak2016.m | .m | pm-architectures-project-master/examples/structured/PMA_EX_STRUCT_Bayrak2016.m | 3,106 | utf_8 | 80ead0f36fb51a95c2a40e1e2f93b8c6 | %--------------------------------------------------------------------------
% PMA_EX_STRUCT_Bayrak2016.m
% Example based on the reference below for generating different hybrid
% powertrain architectures
%--------------------------------------------------------------------------
% Bayrak A, Ren Y, Papalambros PY. Topolo... |
github | danielrherber/pm-architectures-project-master | PMA_EX_MD161635_SuspensionConstraints.m | .m | pm-architectures-project-master/examples/md161635/PMA_EX_MD161635_SuspensionConstraints.m | 3,810 | utf_8 | e5c674a81a396c256172997104f9b469 | %--------------------------------------------------------------------------
% PMA_EX_MD161635_SuspensionConstraints.m
% Additional network structure constraints for Case Study 3 in the paper
% below
%--------------------------------------------------------------------------
% Herber DR, Guo T, Allison JT. Enumeration o... |
github | danielrherber/pm-architectures-project-master | PMA_EX_MD181711_SuspensionConstraints.m | .m | pm-architectures-project-master/examples/md161635/PMA_EX_MD181711_SuspensionConstraints.m | 6,539 | utf_8 | a8c39d330eb40a9f7340b07944e35c5c | %--------------------------------------------------------------------------
% PMA_EX_MD161635_SuspensionConstraints.m
% Additional network structure constraints for ADD TEXT
%--------------------------------------------------------------------------
% ADD REFERENCE
%-----------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_MD161635_CS2.m | .m | pm-architectures-project-master/examples/md161635/PMA_EX_MD161635_CS2.m | 3,595 | utf_8 | 5d47aa4fe01a39c4d649a630dfdb407f | %--------------------------------------------------------------------------
% PMA_EX_MD161635_CS2.m
% This example replicates the results from Case Study 2 in the paper below
%--------------------------------------------------------------------------
% Herber DR, Guo T, Allison JT. Enumeration of Architectures With Per... |
github | danielrherber/pm-architectures-project-master | PMA_EX_MD161635_CS1.m | .m | pm-architectures-project-master/examples/md161635/PMA_EX_MD161635_CS1.m | 2,762 | utf_8 | 01366182e20d608a779b32239997b569 | %--------------------------------------------------------------------------
% PMA_EX_MD161635_CS1.m
% This example replicates the results from Case Study 1 in the paper below
%--------------------------------------------------------------------------
% Herber DR, Guo T, Allison JT. Enumeration of Architectures With Per... |
github | danielrherber/pm-architectures-project-master | PMA_TEST_Algorithms.m | .m | pm-architectures-project-master/tests/PMA_TEST_Algorithms.m | 2,304 | utf_8 | b756c496483fe8424e28be4b7c4c99b3 | %--------------------------------------------------------------------------
% PMA_TEST_Algorithms.m
% Test a bunch of graph generating algorithms for a specified problem
%--------------------------------------------------------------------------
%
%-----------------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_TEST_SubcatalogConstraints.m | .m | pm-architectures-project-master/tests/PMA_TEST_SubcatalogConstraints.m | 2,991 | utf_8 | 42cee8148d68b461157a99d5afc1dfed | %--------------------------------------------------------------------------
% PMA_TEST_SubcatalogConstraints.m
% Test function for linear penalty and satisfaction constraints on catalogs
%--------------------------------------------------------------------------
%
%------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_TEST_MultiedgeBounds.m | .m | pm-architectures-project-master/tests/PMA_TEST_MultiedgeBounds.m | 1,968 | utf_8 | c693b328579de67818db9541d7645883 | %--------------------------------------------------------------------------
% PMA_TEST_MultiedgeBounds.m
% Test function for multiedge bounded methods such as tree_v12DFS
%--------------------------------------------------------------------------
%
%----------------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_TEST_SimpleGraphSubcatalogFilters.m | .m | pm-architectures-project-master/tests/PMA_TEST_SimpleGraphSubcatalogFilters.m | 1,539 | utf_8 | c974c3d3b51eab4d3942f0467edea8ac | %--------------------------------------------------------------------------
% PMA_TEST_SimpleGraphSubcatalogFilters.m
% Test function for PMA_ConnectedSubcatalogFilters
%--------------------------------------------------------------------------
%
%------------------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_TEST_StochasticGraphs.m | .m | pm-architectures-project-master/tests/PMA_TEST_StochasticGraphs.m | 3,601 | utf_8 | 0e3308b407a3276088d96c54cae84a84 | %--------------------------------------------------------------------------
% PMA_TEST_StochasticGraphs.m
% Script to explore the properties of the different stochastic generators
%--------------------------------------------------------------------------
%
%-------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_TEST_MultigraphIsomorphism.m | .m | pm-architectures-project-master/tests/PMA_TEST_MultigraphIsomorphism.m | 1,730 | utf_8 | 49abb890df2f7f19b9de4f8525e3f988 | %--------------------------------------------------------------------------
% PMA_TEST_MultigraphIsomorphism.m
% Test for labeled multigraph isomorphism issues
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Prim... |
github | danielrherber/pm-architectures-project-master | PMA_Change2PythonFolder.m | .m | pm-architectures-project-master/src/PMA_Change2PythonFolder.m | 909 | utf_8 | e3cec7848ac0e690ff113853515d9765 | %--------------------------------------------------------------------------
% PMA_Change2PythonFolder.m
% Change current folder to /src/iso/python for code speedup
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% ... |
github | danielrherber/pm-architectures-project-master | PMA_GenerateFeasibleGraphs.m | .m | pm-architectures-project-master/src/PMA_GenerateFeasibleGraphs.m | 3,939 | utf_8 | cb2c151defd97be156391c780c1f3f12 | %--------------------------------------------------------------------------
% PMA_GenerateFeasibleGraphs.m
% Given an architecture problem, generate a set of feasible graphs
%--------------------------------------------------------------------------
%
%-------------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_DefaultNSC.m | .m | pm-architectures-project-master/src/PMA_DefaultNSC.m | 10,293 | utf_8 | c0f4d89a4b9e924fbb18731e84fd4229 | %--------------------------------------------------------------------------
% PMA_DefaultNSC.m
% Default network structure constraints for PM Architectures Project
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% ... |
github | danielrherber/pm-architectures-project-master | PMA_UniqueFeasibleGraphs.m | .m | pm-architectures-project-master/src/PMA_UniqueFeasibleGraphs.m | 1,316 | utf_8 | 5d0ca866d3cfaaca965624b02c48a822 | %--------------------------------------------------------------------------
% PMA_UniqueFeasibleGraphs.m
% Given an architecture class specification, find the set of unique,
% feasible graphs
%--------------------------------------------------------------------------
%
%-------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_DefaultOpts.m | .m | pm-architectures-project-master/src/PMA_DefaultOpts.m | 7,949 | utf_8 | 9abd30354ef12381153fbfcf98729910 | %--------------------------------------------------------------------------
% PMA_DefaultOpts.m
% Default options for PM Architectures Project
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contributor: ... |
github | danielrherber/pm-architectures-project-master | PMA_ParallelToggle.m | .m | pm-architectures-project-master/src/PMA_ParallelToggle.m | 3,407 | utf_8 | 25a5cb05bfa7acf2869e3e6864c32a9a | %--------------------------------------------------------------------------
% PMA_ParallelToggle.m
% Open and close parallel pools without any command window outputs
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
... |
github | danielrherber/pm-architectures-project-master | PMA_GenerateCandidateGraphs.m | .m | pm-architectures-project-master/src/PMA_GenerateCandidateGraphs.m | 2,419 | utf_8 | db0061f1788b1fa2c6cd0ecb3f9820a2 | %--------------------------------------------------------------------------
% PMA_GenerateCandidateGraphs.m
% Generate candidate graphs with the specific approach
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% P... |
github | danielrherber/pm-architectures-project-master | PMA_SortAsPerfectMatching.m | .m | pm-architectures-project-master/src/pm/PMA_SortAsPerfectMatching.m | 1,350 | utf_8 | 66aa89579ba30f7e20983233832e0350 | %--------------------------------------------------------------------------
% PMA_SortAsPerfectMatching.m
% Given a set of edges, sort the edge set to fulfill the requirements of a
% perfect matching
%--------------------------------------------------------------------------
%
%-----------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_changem.m | .m | pm-architectures-project-master/src/utilities/PMA_changem.m | 650 | utf_8 | ee069f5a9f7e88d4d0c9eb3f86ce7aed | %--------------------------------------------------------------------------
% PMA_changem.m
% Substitute values in an array
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contributor: Daniel R. Herber (d... |
github | danielrherber/pm-architectures-project-master | PMA_PadCatRowVectors.m | .m | pm-architectures-project-master/src/utilities/PMA_PadCatRowVectors.m | 2,021 | utf_8 | e43e309ebb536a55181a59a681ff9775 | %--------------------------------------------------------------------------
% PMA_PadCatRowVectors.m
% Concatenate vectors with different lengths by padding with 0
% Code modified from MFX 22909
%--------------------------------------------------------------------------
% Based on https://www.mathworks.com/matlabcentra... |
github | danielrherber/pm-architectures-project-master | PMA_FixParentPointers.m | .m | pm-architectures-project-master/src/utilities/PMA_FixParentPointers.m | 1,218 | utf_8 | 15eb3545b7165538fa00ff4ed41ce83a | %--------------------------------------------------------------------------
% PMA_FixParentPointers.m
% Fix order of parent pointers vector in representing a tree graph
%--------------------------------------------------------------------------
% Takes a vector of parent nodes for an elimination tree, and re-orders it
... |
github | danielrherber/pm-architectures-project-master | PMA_ConnectivityMatrix.m | .m | pm-architectures-project-master/src/utilities/PMA_ConnectivityMatrix.m | 783 | utf_8 | fb6790a89f34d1e6cec21dd8b84bbb1b | %--------------------------------------------------------------------------
% PMA_ConnectivityMatrix.m
% Create connectivity matrix for a given adjacency matrix
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Pri... |
github | danielrherber/pm-architectures-project-master | PMA_DetectCycle.m | .m | pm-architectures-project-master/src/utilities/PMA_DetectCycle.m | 2,885 | utf_8 | af88513dda84bb996253812c7cfec51b | %--------------------------------------------------------------------------
% PMA_DetectCycle.m
% Given undirected graph adjacency matrix, determine if a cycle is present
% Code modified from MFX 29438
%--------------------------------------------------------------------------
% From https://www.mathworks.com/matlabcen... |
github | danielrherber/pm-architectures-project-master | PMA_BinBasedSorting.m | .m | pm-architectures-project-master/src/utilities/PMA_BinBasedSorting.m | 748 | utf_8 | 6c1ad4462ff2292211453fd04080adcd | %--------------------------------------------------------------------------
% PMA_BinBasedSorting.m
% Sort input vector based on bins
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contributor: Daniel R.... |
github | danielrherber/pm-architectures-project-master | PMA_UpdateLn.m | .m | pm-architectures-project-master/src/utilities/PMA_UpdateLn.m | 941 | utf_8 | 0989f327b8bf32d6ddd8ecc9665c010a | %--------------------------------------------------------------------------
% PMA_UpdateLn.m
% Update Ln (base 10) from L (base 36)
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contributor: Daniel R. H... |
github | danielrherber/pm-architectures-project-master | PMA_ConnCompBins.m | .m | pm-architectures-project-master/src/utilities/PMA_ConnCompBins.m | 1,198 | utf_8 | 2bdfb93fc2c77014342ee93591b2fb9c | %--------------------------------------------------------------------------
% PMA_ConnCompBins.m
% Determine the connected components (grouped in bins) of a graph
% represented by an adjacency matrix A
%--------------------------------------------------------------------------
% Based on the code by Alec Jacobson
% htt... |
github | danielrherber/pm-architectures-project-master | PMA_RemoveIsoLabeledGraphs.m | .m | pm-architectures-project-master/src/iso/PMA_RemoveIsoLabeledGraphs.m | 15,771 | utf_8 | ac45cd4343f44b368cbe2fa499abbf52 | %--------------------------------------------------------------------------
% PMA_RemoveIsoLabeledGraphs.m
% Given a set of labeled graphs, determine the set of nonisomorphic labeled
% graphs
%--------------------------------------------------------------------------
%
%-------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_PortIsoFilter.m | .m | pm-architectures-project-master/src/iso/PMA_PortIsoFilter.m | 2,114 | utf_8 | 654366037818270b03c490c6c59a64f3 | %--------------------------------------------------------------------------
% PMA_PortIsoFilter.m
% Apply the port-type isomorphism filter to remove isomorphic graphs
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_CalcUniqueGraphBnds.m | .m | pm-architectures-project-master/src/iso/PMA_CalcUniqueGraphBnds.m | 1,026 | utf_8 | ab0de81b720d86b4dc0700a2daef0715 | %--------------------------------------------------------------------------
% PMA_CalcUniqueGraphBnds.m
% Using (P,R), determine upper and lower bound on the number of unique
% graphs with no additional network structure constraints
%--------------------------------------------------------------------------
%
%--------... |
github | danielrherber/pm-architectures-project-master | PMA_SubcatalogEnumerationAlg_v2.m | .m | pm-architectures-project-master/src/subcatalogs/PMA_SubcatalogEnumerationAlg_v2.m | 11,021 | utf_8 | 47a4ec2b95784e4d2f8c61d99964a5bb | %--------------------------------------------------------------------------
% PMA_SubcatalogEnumerationAlg_v2.m
% Generate all subcatalogs for a provided (P,R) under some additional
% network structure constraints
%--------------------------------------------------------------------------
%
%---------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_SimpleGraphFilter.m | .m | pm-architectures-project-master/src/subcatalogs/PMA_SimpleGraphFilter.m | 1,521 | utf_8 | b7c47422339925125d02e2a3aadd218c | %--------------------------------------------------------------------------
% PMA_SimpleGraphFilter.m
% Subcatalog checks for the existence of a graph if it is required to have
% simple edges and no loops (Erdos-Gallai theorem)
%--------------------------------------------------------------------------
%
%------------... |
github | danielrherber/pm-architectures-project-master | PMA_TreeFilter.m | .m | pm-architectures-project-master/src/subcatalogs/PMA_TreeFilter.m | 1,107 | utf_8 | b4eae5abe36b3923a723d902ad2193c5 | %--------------------------------------------------------------------------
% PMA_TreeFilter.m
% Subcatalog checks for the existence of a graph if it is required to have
% simple edges, no loops, and be connected (tree graph condition)
%--------------------------------------------------------------------------
%
%-----... |
github | danielrherber/pm-architectures-project-master | PMA_GenerateWithSubcatalogs.m | .m | pm-architectures-project-master/src/subcatalogs/PMA_GenerateWithSubcatalogs.m | 8,436 | utf_8 | ae2d92037df5396f16449e839aa1f2c9 | %--------------------------------------------------------------------------
% PMA_GenerateWithSubcatalogs.m
% Generate the set of unique, feasible graphs using subcatalogs of the
% original (L,P,R)
%--------------------------------------------------------------------------
%
%-------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_TreeGather.m | .m | pm-architectures-project-master/src/tree/PMA_TreeGather.m | 8,629 | utf_8 | 1cf729248753f088895397e352e9301f | %--------------------------------------------------------------------------
% PMA_TreeGather.m
% Complete problem set up and use a particular method to generate graphs
%--------------------------------------------------------------------------
%
%-------------------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_TreeSaveGraphs.m | .m | pm-architectures-project-master/src/tree/PMA_TreeSaveGraphs.m | 1,299 | utf_8 | 21d6cc9679ef6e260849716f01e7f666 | %--------------------------------------------------------------------------
% PMA_TreeSaveGraphs.m
% Save edge sets created by the tree algorithm
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contributo... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v12BFS_analysis.m | .m | pm-architectures-project-master/src/tree/v12/PMA_EnumerationAlg_v12BFS_analysis.m | 10,084 | utf_8 | 8872e1c7b5b3c51ebc284cae9ada9dae | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v12BFS_analysis.m
% Breadth-first search implementation (analysis version)
%--------------------------------------------------------------------------
%
%---------------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v12DFS.m | .m | pm-architectures-project-master/src/tree/v12/PMA_EnumerationAlg_v12DFS.m | 4,014 | utf_8 | f87df6322c0db5474a98926a783f27b9 | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v12DFS.m
% Depth-first search implementation
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contributor: D... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v12BFS.m | .m | pm-architectures-project-master/src/tree/v12/PMA_EnumerationAlg_v12BFS.m | 9,625 | utf_8 | 69dfbd3190081f142c79831bdf3bc759 | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v12BFS.m
% Breadth-first search implementation
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contributor:... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v12DFS_analysis.m | .m | pm-architectures-project-master/src/tree/v12/PMA_EnumerationAlg_v12DFS_analysis.m | 4,252 | utf_8 | 7b985d290502acdb24e3dd32f3d93d35 | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v12DFS_analysis.m
% Depth-first search implementation (analysis version)
%--------------------------------------------------------------------------
%
%-----------------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v8.m | .m | pm-architectures-project-master/src/tree/v8/PMA_EnumerationAlg_v8.m | 3,485 | utf_8 | 81220c436ce511761741d1631224b6a6 | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v8.m
% This includes all the relevant enhancements in the technical report
%--------------------------------------------------------------------------
%
%---------------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_StochasticAlg_v8.m | .m | pm-architectures-project-master/src/tree/v8/PMA_StochasticAlg_v8.m | 3,284 | utf_8 | 7a4f935cef5616338ae61775c81a7c00 | %--------------------------------------------------------------------------
% PMA_StochasticAlg_v8.m
% Using the tree_v8 algorithm, generate a single graph using randomly
% selected feasible edges
%--------------------------------------------------------------------------
%
%--------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v8_analysis.m | .m | pm-architectures-project-master/src/tree/v8/PMA_EnumerationAlg_v8_analysis.m | 3,716 | utf_8 | c5dc39ba6e37c6c59fc1251a684b16b3 | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v8_analysis.m
% This includes all the relevant enhancements in the technical report
% (analysis version)
%--------------------------------------------------------------------------
%
%---------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v10.m | .m | pm-architectures-project-master/src/tree/v10/PMA_EnumerationAlg_v10.m | 9,760 | utf_8 | 04dcf8f81010fb69b742788ba5da137d | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v10.m
% Breadth-first search implementation of v8
% This new method should be considered under development
% At each level, you can optionally perform for port-type and/or full
% isomorphism checking (the primary motivation... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v10_analysis.m | .m | pm-architectures-project-master/src/tree/v10/PMA_EnumerationAlg_v10_analysis.m | 10,219 | utf_8 | 03ca8f6eb20f1cadf41b99d23be63399 | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v10_analysis.m
% Breadth-first search implementation of v8 (analysis version)
% This new method should be considered under development
% At each level, you can optionally perform for port-type and/or full
% isomorphism chec... |
github | danielrherber/pm-architectures-project-master | PMA_StochasticAlg_v10.m | .m | pm-architectures-project-master/src/tree/v10/PMA_StochasticAlg_v10.m | 9,800 | utf_8 | 6c7b37337cc91170bc3168efe6a398f7 | %--------------------------------------------------------------------------
% PMA_StochasticAlg_v10.m
% Breadth-first search implementation of v8
% This new method should be considered under development
% At each level, you can optionally perform for port-type and/or full
% isomorphism checking (the primary motivation ... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v11DFS.m | .m | pm-architectures-project-master/src/tree/v11/PMA_EnumerationAlg_v11DFS.m | 4,136 | utf_8 | 5817ed18daae8652b728d0198ab3c8d1 | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v11DFS.m
% Depth-first search implementation
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contributor: D... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v11DFS_analysis.m | .m | pm-architectures-project-master/src/tree/v11/PMA_EnumerationAlg_v11DFS_analysis.m | 4,374 | utf_8 | 43e59dcac3fd4227bc3e2f89d3cf634c | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v11DFS_analysis.m
% Depth-first search implementation (analysis version)
%--------------------------------------------------------------------------
%
%-----------------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v11BFS.m | .m | pm-architectures-project-master/src/tree/v11/PMA_EnumerationAlg_v11BFS.m | 10,525 | utf_8 | 78bac64a182b16aaedfee7311dbd9b41 | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v11BFS.m
% Breadth-first search implementation
% This new method should be considered under development
% At each level, you can optionally perform for port-type and/or full
% isomorphism checking (the primary motivation fo... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v11BFS_analysis.m | .m | pm-architectures-project-master/src/tree/v11/PMA_EnumerationAlg_v11BFS_analysis.m | 10,984 | utf_8 | 5146d1d4772a24c123ec268cf1b4b2fb | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v11BFS_analysis.m
% Breadth-first search implementation (analysis version)
% This new method should be considered under development
% At each level, you can optionally perform for port-type and/or full
% isomorphism checkin... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v1_analysis.m | .m | pm-architectures-project-master/src/tree/v1/PMA_EnumerationAlg_v1_analysis.m | 1,640 | utf_8 | 5dda8931a853297ba97a7ebb9e404f5c | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v1_analysis.m
% This is the algorithm in the DETC paper (analysis version)
%--------------------------------------------------------------------------
%
%---------------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_StochasticAlg_v1.m | .m | pm-architectures-project-master/src/tree/v1/PMA_StochasticAlg_v1.m | 1,501 | utf_8 | 6e5740ba7e8ca45111f3c97cdf34a76d | %--------------------------------------------------------------------------
% PMA_StochasticAlg_v1.m
% Using the tree_v1 algorithm, generate a single graph using randomly
% selected feasible edges
%--------------------------------------------------------------------------
%
%--------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v1.m | .m | pm-architectures-project-master/src/tree/v1/PMA_EnumerationAlg_v1.m | 1,478 | utf_8 | 950aec74630cbc4606c38b6bb3fe2139 | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v1.m
% This is the algorithm in the DETC paper
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contributor:... |
github | danielrherber/pm-architectures-project-master | PMA_PlotBGL.m | .m | pm-architectures-project-master/src/plot/PMA_PlotBGL.m | 3,988 | utf_8 | dfa692d08efb3307fd6f747980a05c9f | %--------------------------------------------------------------------------
% PMA_PlotBGL.m
% Custom plotting function using a force directed layout
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contrib... |
github | danielrherber/pm-architectures-project-master | PMA_LabelColors.m | .m | pm-architectures-project-master/src/plot/PMA_LabelColors.m | 3,646 | utf_8 | f7249e046c5b31f3814b6a16b8a1166f | %--------------------------------------------------------------------------
% PMA_LabelColors.m
% Given a specific string, output a specific color
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contribut... |
github | danielrherber/pm-architectures-project-master | PMA_PlotMatlab2018b.m | .m | pm-architectures-project-master/src/plot/PMA_PlotMatlab2018b.m | 3,032 | utf_8 | da7f8cf7947cc222cf579face293425e | %--------------------------------------------------------------------------
% PMA_PlotMatlab2018b.m
% Custom plotting function using built-in Matlab functions
% Particularly useful for unconnected graphs
% Syntax used is only available in r2018b
%-------------------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_PlotGraphs.m | .m | pm-architectures-project-master/src/plot/PMA_PlotGraphs.m | 1,706 | utf_8 | d3b8c56e3e83e014de03f7244a0d6826 | %--------------------------------------------------------------------------
% PMA_PlotGraphs.m
% Plots a set of labeled graphs
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contributor: Daniel R. Herber... |
github | danielrherber/pm-architectures-project-master | PMA_PlotMatlab.m | .m | pm-architectures-project-master/src/plot/PMA_PlotMatlab.m | 3,123 | utf_8 | a0bd6218b0638883a634ec7f07251ba6 | %--------------------------------------------------------------------------
% PMA_PlotMatlab.m
% Custom plotting function using built-in Matlab functions
% Particularly useful for unconnected graphs
%--------------------------------------------------------------------------
%
%------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_PlotCircle.m | .m | pm-architectures-project-master/src/plot/PMA_PlotCircle.m | 3,856 | utf_8 | 13d0bd27cce6a3b8027b4b60a93f3b12 | %--------------------------------------------------------------------------
% PMA_PlotCircle.m
% Custom plotting function using a circle of vertices
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contrib... |
github | danielrherber/pm-architectures-project-master | PMA_PlotBio.m | .m | pm-architectures-project-master/src/plot/PMA_PlotBio.m | 1,119 | utf_8 | c940b186e6441e480f25e1aefed2924f | %--------------------------------------------------------------------------
% PMA_PlotBio.m
% Custom plotting function using the biograph viewer
% Particularly useful for unconnected graphs
%--------------------------------------------------------------------------
%
%---------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_STRUCT_HelpAdjacencyNSC.m | .m | pm-architectures-project-master/src/structured/PMA_STRUCT_HelpAdjacencyNSC.m | 4,328 | utf_8 | d6a59874f526b649211ffb0b1bfb41a3 | %--------------------------------------------------------------------------
% PMA_STRUCT_HelpAdjacencyNSC.m
% Helper function for structured labels
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contribu... |
github | danielrherber/pm-architectures-project-master | PMA_STRUCT_Sort.m | .m | pm-architectures-project-master/src/structured/PMA_STRUCT_Sort.m | 6,425 | utf_8 | af6269df67989fd022af914001864d9a | %--------------------------------------------------------------------------
% PMA_STRUCT_Sort.m
% Optionally sort the labels before expanding the structured components
%--------------------------------------------------------------------------
%
%-------------------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_STRUCT_ExpandGraphs.m | .m | pm-architectures-project-master/src/structured/PMA_STRUCT_ExpandGraphs.m | 5,365 | utf_8 | f72f220ec689a76123b61e1760a4993d | %--------------------------------------------------------------------------
% PMA_STRUCT_ExpandGraphs.m
% Generate all structured graphs from a single simple graph
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% ... |
github | danielrherber/pm-architectures-project-master | PMA_STRUCT_ShrinkLabel.m | .m | pm-architectures-project-master/src/structured/PMA_STRUCT_ShrinkLabel.m | 3,143 | utf_8 | 2d051f404c7875d7edbbcdb07c185e50 | %--------------------------------------------------------------------------
% PMA_STRUCT_ShrinkLabel.m
% Obtain equivalent simple graph labels and ports from a structured graph
%--------------------------------------------------------------------------
%
%----------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_STRUCT_DefaultOpts.m | .m | pm-architectures-project-master/src/structured/PMA_STRUCT_DefaultOpts.m | 2,615 | utf_8 | e64e0360e93d8e621d2b98dc855b2f26 | %--------------------------------------------------------------------------
% PMA_STRUCT_DefaultOpts.m
% Default options for enumeration of graphs with structured components
%--------------------------------------------------------------------------
%
%-------------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_STRUCT_GeneratePermutations.m | .m | pm-architectures-project-master/src/structured/PMA_STRUCT_GeneratePermutations.m | 2,854 | utf_8 | 7fddc68bb03cc64a4339f59a35595312 | %--------------------------------------------------------------------------
% PMA_STRUCT_GeneratePermutations.m
% Generate the permutations for a single structured component
%--------------------------------------------------------------------------
% outputs
% oPermLoops(k,:) are sequential pairs that indicate what in... |
github | danielrherber/pm-architectures-project-master | PMA_STRUCT_DispAdjacencyIdxLabels.m | .m | pm-architectures-project-master/src/structured/PMA_STRUCT_DispAdjacencyIdxLabels.m | 1,984 | utf_8 | 78ab0c27eca90f5a599721565df3a293 | %--------------------------------------------------------------------------
% PMA_STRUCT_DispAdjacencyIdxLabels.m
% Helps display final label list and construct directA
%--------------------------------------------------------------------------
%
%------------------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_STRUCT_ExpandPorts.m | .m | pm-architectures-project-master/src/structured/PMA_STRUCT_ExpandPorts.m | 1,215 | utf_8 | 8ce73ba0b0cbcdfa1823357e61b8fa0c | %--------------------------------------------------------------------------
% PMA_STRUCT_ExpandPorts.m
% Expands (L,S,P) based on the number of ports in the first structured
% component in S
%--------------------------------------------------------------------------
%
%--------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_STRUCT_UniqueUsefulGraphs.m | .m | pm-architectures-project-master/src/structured/PMA_STRUCT_UniqueUsefulGraphs.m | 2,593 | utf_8 | 2adc8dea30b02bf2244ececb8f830a5f | %--------------------------------------------------------------------------
% PMA_STRUCT_UniqueUsefulGraphs.m
% Given a set of unique simple graphs with structured components specified,
% find the set of unique structured graphs
%--------------------------------------------------------------------------
%
%------------... |
github | danielrherber/pm-architectures-project-master | PMA_STRUCT_SimpleCheckConnections.m | .m | pm-architectures-project-master/src/structured/iso/PMA_STRUCT_SimpleCheckConnections.m | 3,733 | utf_8 | a573964750aadf7cb04d22d4968622cf | %--------------------------------------------------------------------------
% PMA_STRUCT_SimpleCheckConnections.m
% Create the required data for the simple checks
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% P... |
github | danielrherber/pm-architectures-project-master | PMA_STRUCT_RemovedColoredIsosPythonSimple.m | .m | pm-architectures-project-master/src/structured/iso/PMA_STRUCT_RemovedColoredIsosPythonSimple.m | 5,836 | utf_8 | 7af131c7e3234e671a4609188a3f92dd | %--------------------------------------------------------------------------
% PMA_STRUCT_RemovedColoredIsosPythonSimple.m
% Given a set of structured labeled graphs, determine the set of
% nonisomorphic structured labeled graphs, Python implementation with the
% simple checks
%------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_STRUCT_RemovedColoredIsos.m | .m | pm-architectures-project-master/src/structured/iso/PMA_STRUCT_RemovedColoredIsos.m | 2,933 | utf_8 | 5dd6692c88170c48ceda7d2a87fae59a | %--------------------------------------------------------------------------
% PMA_STRUCT_RemovedColoredIsos.m
% Given a set of structured labeled graphs, determine the set of
% nonisomorphic structured labeled graphs
%--------------------------------------------------------------------------
%
%------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_STRUCT_RemovedColoredIsosMatlabSimple.m | .m | pm-architectures-project-master/src/structured/iso/PMA_STRUCT_RemovedColoredIsosMatlabSimple.m | 4,445 | utf_8 | 64a6d3e5a2a86d1f68887a356743f71a | %--------------------------------------------------------------------------
% PMA_STRUCT_RemovedColoredIsosMatlabSimple.m
% Given a set of structured labeled graphs, determine the set of
% nonisomorphic structured labeled graphs, MATLAB only implementation with
% the simple checks
%-------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_TEST_STRUCT_ExampleSimpleGraphs.m | .m | pm-architectures-project-master/src/structured/tests/PMA_TEST_STRUCT_ExampleSimpleGraphs.m | 6,979 | utf_8 | 26651189c89ed461a29f9e10977c716f | %--------------------------------------------------------------------------
% PMA_TEST_STRUCT_ExampleSimpleGraphs.m
% Create or loading graph examples
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contr... |
github | danielrherber/pm-architectures-project-master | PMA_RemovedStranded.m | .m | pm-architectures-project-master/src/nsc/PMA_RemovedStranded.m | 1,539 | utf_8 | 7dcf58415ae174674411ba6ae20d57ae | %--------------------------------------------------------------------------
% PMA_RemovedStranded.m
% Find stranded components that are not connected to the specified
% mandatory components and remove them from the graph
%--------------------------------------------------------------------------
%
%--------------------... |
github | danielrherber/pm-architectures-project-master | PMA_CheckNSCFeasibility.m | .m | pm-architectures-project-master/src/nsc/PMA_CheckNSCFeasibility.m | 2,754 | utf_8 | 58a21b5898a8b6a917ed1ff3cdbdf342 | %--------------------------------------------------------------------------
% PMA_CheckNSCFeasibility.m
% Given a PM edge set, construct the graph and check for NSC satisfaction
%--------------------------------------------------------------------------
%
%---------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_ExtractLineConstraints.m | .m | pm-architectures-project-master/src/nsc/PMA_ExtractLineConstraints.m | 2,991 | utf_8 | 812e8e7da3e44b70a0dbd974784356b5 | %--------------------------------------------------------------------------
% PMA_ExtractLineConstraints.m
% Extract appropriate line-connectivity triples
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary c... |
github | danielrherber/pm-architectures-project-master | PMA_ReorderCRP.m | .m | pm-architectures-project-master/src/nsc/PMA_ReorderCRP.m | 1,975 | utf_8 | ecb295a5eb311a2846e17f1acbe65aeb | %--------------------------------------------------------------------------
% PMA_ReorderCRP.m
% Sort (C,R,P) to be better suited for enumeration
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contributo... |
github | danielrherber/pm-architectures-project-master | PMA_CheckLineConstraints.m | .m | pm-architectures-project-master/src/nsc/PMA_CheckLineConstraints.m | 1,631 | utf_8 | 8eef774610d4049dea9755296617e1e1 | %--------------------------------------------------------------------------
% PMA_CheckLineConstraints.m
% Check line-connectivity constraints
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contributor: ... |
github | danielrherber/pm-architectures-project-master | PMA_GeneratePortsGraph.m | .m | pm-architectures-project-master/src/nsc/PMA_GeneratePortsGraph.m | 2,486 | utf_8 | 7f7fcaf35aa6fdc13a3f7b7c9208ba90 | %--------------------------------------------------------------------------
% PMA_GeneratePortsGraph.m
% Given an architecture problem, generate the ports graph and additional
% items
%--------------------------------------------------------------------------
%
%---------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_ExpandPossibleAdj.m | .m | pm-architectures-project-master/src/nsc/PMA_ExpandPossibleAdj.m | 1,319 | utf_8 | 75c6125e9c16947968e31172ad3404de | %--------------------------------------------------------------------------
% PMA_ExpandPossibleAdj.m
% Expand the reduced potential adjacency matrix to the full potential
% adjacency matrix
%--------------------------------------------------------------------------
%
%--------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_Check4PathWithIntermediate.m | .m | pm-architectures-project-master/src/nsc/PMA_Check4PathWithIntermediate.m | 1,759 | utf_8 | 83e625110089a2242532fb0057e938f8 | %--------------------------------------------------------------------------
% PMA_Check4PathWithIntermediate.m
% Check if there exists a path between a defined start and end node that
% contains a specified intermediate node
%--------------------------------------------------------------------------
%
%----------------... |
github | danielrherber/pm-architectures-project-master | PMA_CreateBMatrix.m | .m | pm-architectures-project-master/src/nsc/PMA_CreateBMatrix.m | 1,319 | utf_8 | 23c4556e5c7fb2243d71b0b6a2abbb9c | %--------------------------------------------------------------------------
% PMA_CreateBMatrix.m
% Create 3-D array with line-connectivity constraint information
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% P... |
github | danielrherber/pm-architectures-project-master | TreeSaveGraphs.m | .m | pm-architectures-project-master/src/legacy/TreeSaveGraphs.m | 724 | utf_8 | bf868899143d2513e597f0f8192140a2 | %--------------------------------------------------------------------------
% TreeSaveGraphs.m
% Save edge sets created by the tree algorithm
%--------------------------------------------------------------------------
% NOTE: purpose of this function is only to maintain compatibility with a
% previous function name
%--... |
github | danielrherber/pm-architectures-project-master | PMA_RemoveIsoColoredGraphs.m | .m | pm-architectures-project-master/src/legacy/PMA_RemoveIsoColoredGraphs.m | 794 | utf_8 | 6f6732b785781a3c656d69d09779767e | %--------------------------------------------------------------------------
% PMA_RemoveIsoColoredGraphs.m
% Given a set of labeled graphs, determine the set of nonisomorphic labeled
% graphs
%--------------------------------------------------------------------------
% NOTE: purpose of this function is only to maintain... |
github | danielrherber/pm-architectures-project-master | UniqueUsefulGraphs.m | .m | pm-architectures-project-master/src/legacy/UniqueUsefulGraphs.m | 784 | utf_8 | bf53434e51d680bf9a2fc3ea0145cb92 | %--------------------------------------------------------------------------
% UniqueUsefulGraphs.m
% Given an architecture class specification, find the set of unique,
% feasible graphs
%--------------------------------------------------------------------------
% NOTE: purpose of this function is only to maintain compa... |
github | danielrherber/pm-architectures-project-master | PMA_RemoveIsoColoredGraphsPython.m | .m | pm-architectures-project-master/src/legacy/PMA_RemoveIsoColoredGraphsPython.m | 830 | utf_8 | 83b2388a52fdd83d7384fa20778d96ab | %--------------------------------------------------------------------------
% PMA_RemoveIsoColoredGraphsPython.m
% Given a set of labeled graphs, determine the set of nonisomorphic labeled
% graphs (python implementation)
%--------------------------------------------------------------------------
% NOTE: purpose of thi... |
github | danielrherber/pm-architectures-project-master | closeallbio.m | .m | pm-architectures-project-master/src/legacy/closeallbio.m | 643 | utf_8 | 1f62a59bee63625aa4ab47b477c87922 | %--------------------------------------------------------------------------
% closeallbio.m
% Close all biograph objects
%--------------------------------------------------------------------------
% NOTE: purpose of this function is only to maintain compatibility with a
% previous function name
%-----------------------... |
github | danielrherber/pm-architectures-project-master | PMA_RemoveIsoColoredGraphsMatlab.m | .m | pm-architectures-project-master/src/legacy/PMA_RemoveIsoColoredGraphsMatlab.m | 830 | utf_8 | 6700889f73a9ed56444e5961e7af8cdd | %--------------------------------------------------------------------------
% PMA_RemoveIsoColoredGraphsMatlab.m
% Given a set of labeled graphs, determine the set of nonisomorphic labeled
% graphs (matlab implementation)
%--------------------------------------------------------------------------
% NOTE: purpose of thi... |
github | Fusion-Goettingen/ExtendedObjectTracking-master | Hungarian.m | .m | ExtendedObjectTracking-master/Evaluation/hungarian/Hungarian.m | 9,328 | utf_8 | 51e60bc9f1f362bfdc0b4f6d67c44e80 | function [Matching,Cost] = Hungarian(Perf)
%
% [MATCHING,COST] = Hungarian_New(WEIGHTS)
%
% A function for finding a minimum edge weight matching given a MxN Edge
% weight matrix WEIGHTS using the Hungarian Algorithm.
%
% An edge weight of Inf indicates that the pair of vertices given by its
% position have no... |
github | Fusion-Goettingen/ExtendedObjectTracking-master | updateEKF.m | .m | ExtendedObjectTracking-master/MEM_EKF/updateEKF.m | 1,412 | utf_8 | 96d1e5ba0ceac69903c4d738303c431b | function [ r_hat, C_r,p_hat, C_p ] = updateEKF(r_hat, C_r, p_hat, C_p, y, C_v, C_h)
[S_hat,M_hat] = getMS(p_hat,C_h);
H = [1 0 0 0;0 1 0 0];
% moments of kinematic state
E_y = H*r_hat;
C_ry = C_r*H';
C_yy = H*C_r*H' + S_hat*C_h*S_hat'+C_v;
% kinematic state update
r_hat = r_hat + C_ry*(C_yy)^(-1)*(y-E_y);
C_r = ... |
github | Fusion-Goettingen/ExtendedObjectTracking-master | randomHypersurfaceModel_2011.m | .m | ExtendedObjectTracking-master/RandomHypersurfaceModel/randomHypersurfaceModel_2011.m | 5,887 | utf_8 | 41116776951ffbef2cb6eba6fc8ca3e4 | % Implementation of Star-Convex RHMs using Fourier Coefficients and the UKF according to the paper
%
% M. Baum and U. D. Hanebeck, "Shape tracking of extended objects and group targets with star-convex RHMs,"
% 14th International Conference on Information Fusion, Chicago, IL, 2011, pp. 1-8.
% URL: http://ieeexplo... |
github | Fusion-Goettingen/ExtendedObjectTracking-master | time_update.m | .m | ExtendedObjectTracking-master/MEM-EKFstar/time_update.m | 549 | utf_8 | e40bb2f32869dda22decdac75c011458 | % Implementation of the MEM-EKF* algorithm based on the article
%
% "Tracking the Orientation and Axes Lengths of an Elliptical Extended Object"
% Shishan Yang and Marcus Baum
% arXiv preprint, 2018,
% https://arxiv.org/abs/1805.03276
%
% Further information:
% http://www.fusion.informatik.uni-goettingen.de
% https:/... |
github | Fusion-Goettingen/ExtendedObjectTracking-master | measurement_update.m | .m | ExtendedObjectTracking-master/MEM-EKFstar/measurement_update.m | 1,915 | utf_8 | 50e92a9c502bc2010c8e9cb8ed595bdd | % Implementation of the MEM-EKF* algorithm based on the article
%
% "Tracking the Orientation and Axes Lengths of an Elliptical Extended Object"
% Shishan Yang and Marcus Baum
% arXiv preprint, 2018,
% https://arxiv.org/abs/1805.03276
%
% Further information:
% http://www.fusion.informatik.uni-goettingen.de
% https:/... |
github | Fusion-Goettingen/ExtendedObjectTracking-master | plot_extent.m | .m | ExtendedObjectTracking-master/MEM-EKFstar/plot_extent.m | 1,331 | utf_8 | 9934c6009e4a0fc52d31f7c9a66d17c4 | % Implementation of the MEM-EKF* algorithm based on the article
%
% "Tracking the Orientation and Axes Lengths of an Elliptical Extended Object"
% Shishan Yang and Marcus Baum
% arXiv preprint, 2018,
% https://arxiv.org/abs/1805.03276
%
% Further information:
% http://www.fusion.informatik.uni-goettingen.de
% https:/... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.