{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"minvo","owner":"mit-acl","isFork":false,"description":"Simplexes with Minimum Volume Enclosing Polynomial Curves","allTopics":["bezier","convex-hull","bspline","bernstein","polynomial-bases","minimum-volume","minvo"],"primaryLanguage":{"name":"MATLAB","color":"#e16737"},"pullRequestCount":0,"issueCount":1,"starsCount":68,"forksCount":11,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-01-19T12:41:04.993Z"}},{"type":"Public","name":"clear","owner":"mit-acl","isFork":false,"description":"CLEAR algorithm for multi-view data association","allTopics":[],"primaryLanguage":{"name":"MATLAB","color":"#e16737"},"pullRequestCount":0,"issueCount":0,"starsCount":35,"forksCount":8,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-10-15T20:57:55.166Z"}},{"type":"Public","name":"multiagent_planning","owner":"mit-acl","isFork":true,"description":"Implementation of several multiagent trajectory generation algorithms","allTopics":[],"primaryLanguage":{"name":"MATLAB","color":"#e16737"},"pullRequestCount":0,"issueCount":0,"starsCount":12,"forksCount":21,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-07-21T21:13:14.291Z"}}],"repositoryCount":3,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"Repositories"}