{"id":50306290,"url":"https://github.com/ghostandthemachine/roboto","last_synced_at":"2026-05-28T16:31:33.393Z","repository":{"id":11452090,"uuid":"13912810","full_name":"ghostandthemachine/roboto","owner":"ghostandthemachine","description":"A Clojure implementation of solving a global localization problem given a sequence of sensory input of a robot","archived":false,"fork":false,"pushed_at":"2013-10-30T19:51:06.000Z","size":696,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2023-03-11T01:20:37.046Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Clojure","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ghostandthemachine.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2013-10-28T00:02:51.000Z","updated_at":"2013-10-30T19:51:10.000Z","dependencies_parsed_at":"2022-08-20T15:40:58.357Z","dependency_job_id":null,"html_url":"https://github.com/ghostandthemachine/roboto","commit_stats":null,"previous_names":[],"tags_count":0,"template":null,"template_full_name":null,"purl":"pkg:github/ghostandthemachine/roboto","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ghostandthemachine%2Froboto","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ghostandthemachine%2Froboto/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ghostandthemachine%2Froboto/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ghostandthemachine%2Froboto/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ghostandthemachine","download_url":"https://codeload.github.com/ghostandthemachine/roboto/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ghostandthemachine%2Froboto/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33617718,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-05-28T02:00:06.440Z","response_time":99,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2026-05-28T16:31:33.306Z","updated_at":"2026-05-28T16:31:33.388Z","avatar_url":"https://github.com/ghostandthemachine.png","language":"Clojure","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Mr. Roboto\n\nThis is a Chico State CSCI 580 (A.I.) homework assignment\n\n#### The problem\n\nUsing a predefined grid world of available and blocked spaces, this program will make a best guess of a robot's location. The user enters sensory data in the form of movement directions consisting of binary flags (NSWE). Intitally, the user enters the number of iterations (directional transitions) to perform.\n\n## To run\n\n`lein run`\n\nThe the user then will be prompted to input the number of iterations followed by the sensory input in binary form\n\nNOTE: *currently the grid world is predefined*\n\n#### Grid World\n````clojure\n [1  2  3  4  5\n  6  X  7  X  8\n  9  10 11 12 13]\n````\n\n*where x denotes a barrier*\n\n#### Sensory input (robot movement)\n\nUser input is in the form of binary flags in the order: north, south, west and east (NSWE)\n\nfor example:\n\nnorth, south (NS)\n`1100`\n\nnorth, south, west (NSW)\n`1110`\n\n#### Example\n\n````clojure\n\nlein run\n\n=\u003e Enter number of iterations to calculate:\n2\n\n=\u003e Calculate with \u003c2\u003e iterationsn\n\n=\u003e Enter next command\n1100\n \n=\u003e Enter next command\n1110\n\n\n=\u003e {:indexes [0 8],\n=\u003e  :Y\n=\u003e  [0.11213448893384917\n=\u003e   0.016609479022843165\n=\u003e   0.2242416371614879\n=\u003e   0.016609479022843165\n=\u003e   0.11213448893384917\n=\u003e   0.003321895804568632\n=\u003e   0.0298970622411177\n=\u003e   0.003321895804568632\n=\u003e   0.11213448893384917\n=\u003e   0.016609479022843165\n=\u003e   0.22424163716148787\n=\u003e   0.016609479022843165\n=\u003e   0.11213448893384917],\n=\u003e  :Z\n=\u003e  [0.008174604243277605\n=\u003e   0.0012108310207652668\n=\u003e   0.001816357261008052\n=\u003e   0.0012108310207652668\n=\u003e   1.0092104004046425E-4\n=\u003e   2.9897062241117686E-6\n=\u003e   2.690735601700593E-5\n=\u003e   2.9897062241117686E-6\n=\u003e   0.008174604243277605\n=\u003e   0.0012108310207652668\n=\u003e   0.0018163572610080518\n=\u003e   0.0012108310207652668\n=\u003e   1.0092104004046425E-4],\n=\u003e  :D [1 1 2 1 3 3 3 3 1 1 2 1 3],\n=\u003e  :O\n=\u003e  [[0.0729 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0]\n=\u003e   [0.0 0.0729 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0]\n=\u003e   [0.0 0.0 0.0081 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0]\n=\u003e   [0.0 0.0 0.0 0.0729 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0]\n=\u003e   [0.0 0.0 0.0 0.0 9.0E-4 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0]\n=\u003e   [0.0 0.0 0.0 0.0 0.0 9.0E-4 0.0 0.0 0.0 0.0 0.0 0.0 0.0]\n=\u003e   [0.0 0.0 0.0 0.0 0.0 0.0 9.0E-4 0.0 0.0 0.0 0.0 0.0 0.0]\n=\u003e   [0.0 0.0 0.0 0.0 0.0 0.0 0.0 9.0E-4 0.0 0.0 0.0 0.0 0.0]\n=\u003e   [0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0729 0.0 0.0 0.0 0.0]\n=\u003e   [0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0729 0.0 0.0 0.0]\n=\u003e   [0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0081 0.0 0.0]\n=\u003e   [0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0729 0.0]\n=\u003e   [0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 9.0E-4]],\n=\u003e  :F\n=\u003e  [0.3262015998256128\n=\u003e   0.04831732574906216\n=\u003e   0.07248040721762605\n=\u003e   0.04831732574906216\n=\u003e   0.004027180244760651\n=\u003e   1.1930203888657318E-4\n=\u003e   0.0010737183499791591\n=\u003e   1.1930203888657318E-4\n=\u003e   0.3262015998256128\n=\u003e   0.04831732574906216\n=\u003e   0.07248040721762604\n=\u003e   0.04831732574906216\n=\u003e   0.004027180244760651]}\n\n=\u003e Most likely positions: [0 8]\n````\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fghostandthemachine%2Froboto","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fghostandthemachine%2Froboto","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fghostandthemachine%2Froboto/lists"}