{"as_of":"2026-08-16T19:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ecc3bdd7034b9da75de53b519497cace222029f66643353a816bb31b0f9a6467","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:47:44.733071Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.08493/citation-record","integrity":"/paper/1908.08493/integrity","json":"/paper/1908.08493/citation-record.json","paper":"/paper/1908.08493"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:45.141129Z","title":"Real-time motion planning methods for autonomous on-road driving: State-of-the-art and future research directions,","venue":null,"work_id":"0775141f-de23-4832-9ddf-e56db078ac87","year":2015},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.612228Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:58c607e8bc3c691ff7adc6381f28710e2d36fcfb09975dbe3c800bc61e3653ab","observation_id":"59b34ed5-d5fa-4c6a-a1a4-a9561e2990e8","resolution":{"observed_at":"2026-08-14T11:47:45.146001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:45.125960Z","title":"A survey of motion planning and control techniques for self-driving urban vehicles,","venue":null,"work_id":"7637a5c1-1853-436d-b34d-819e02275a92","year":2016},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.617954Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:3508665a84e0b5d260971aed7e147891ddb3a260ebacf39d7526d894b63b7811","observation_id":"982729f3-3428-4e8b-8bad-72614bcd27f1","resolution":{"observed_at":"2026-08-14T11:47:45.130720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:45.112023Z","title":"Sampling-based algorithms for optimal motion planning,","venue":null,"work_id":"d21e23d2-5e3d-42cd-97bc-41d4ca7262ba","year":2011},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.622927Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:167b8664e177baceb6af3f2cf58595c2ab8dd2345efcca69b73e59d87691fd8a","observation_id":"5a8edc8c-14ed-4a99-bc75-6ab1f14fa4d7","resolution":{"observed_at":"2026-08-14T11:47:45.116662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:45.098259Z","title":"Sampling-based robot motion planning: A review,","venue":null,"work_id":"1b776fe7-1b75-4013-9822-5ea512a60970","year":2014},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.627544Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:72bf706a4aa4cbefb751ad75b28eb1688351d4c483b5d56d5c67f997afdc5f98","observation_id":"3ccca0c8-2794-41c7-9ffc-cec79a29dbef","resolution":{"observed_at":"2026-08-14T11:47:45.102726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:45.084358Z","title":"Batch informed trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs,","venue":null,"work_id":"eb0dd4d7-a03a-4e5c-a9ee-811fefea6c6a","year":2015},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.632311Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:7e4948208c88e119f124022dd8fe9326952124349f2060181250e085ec786133","observation_id":"2fc3953b-d5df-4a17-a73d-6d7fb638588d","resolution":{"observed_at":"2026-08-14T11:47:45.088964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:45.070201Z","title":"Regionally accelerated batch informed trees (RABIT*): A framework to integrate local information into optimal path planning,","venue":null,"work_id":"d2e6d38d-b5c7-4fe0-9ba0-f9c1b4eb2aae","year":2016},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.636978Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:8ebe6aa7bd678628006f35e9706edf85d1d6c202638bcb8013314a8432eee9a7","observation_id":"5290a356-ba88-43cd-85ab-8ad16739e477","resolution":{"observed_at":"2026-08-14T11:47:45.074962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:45.055986Z","title":"Computing large convex regions of obstacle- free space through semidefinite programming,","venue":null,"work_id":"07ce73fc-ae03-4714-af89-85f640979062","year":2015},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.642108Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:8cea51f89193576eac3a525f48f08a68c8948038ca2d20685b17881ab98966b2","observation_id":"7b41f06a-7ebc-4839-ab10-06dff1329d68","resolution":{"observed_at":"2026-08-14T11:47:45.060639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:45.041574Z","title":"Aggressive quadrotor flight through cluttered environments using mixed integer programming,","venue":null,"work_id":"73abe78b-aa53-4efb-bf24-4f26d54fbd7e","year":2016},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.646490Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:d8d4880ecbca7a63f787afb5246e09625e6fa361f8114264e0ee082da1e3f872","observation_id":"c854be8a-0a0f-4eab-b70a-7eb0f4573ceb","resolution":{"observed_at":"2026-08-14T11:47:45.046219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:45.027481Z","title":"Kinodynamic RRT*: Asymptotically optimal motion planning for robots with linear dynamics,","venue":null,"work_id":"ac75553f-8c30-4447-8999-1e355116baf0","year":2013},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.650651Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:4f41c21bb54e3306444732159d284c7cd15b7acdd0d373e94930d1eaff4afd61","observation_id":"fabc3d4e-5d40-46da-bfb1-e9c6ff2d9cf5","resolution":{"observed_at":"2026-08-14T11:47:45.032080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:45.013576Z","title":"Toward asymptotically optimal motion planning for kinodynamic systems using a two-point boundary value problem solver,","venue":null,"work_id":"520c54ef-707f-48ab-9998-72c63e68707a","year":2015},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.655023Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:936e93c4700667e295baadf6206a991c6be48618178ec858496093b59d1b106c","observation_id":"add85d5c-7605-4d36-a7fc-a7cf5ba865a2","resolution":{"observed_at":"2026-08-14T11:47:45.018180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:44.999670Z","title":"Polynomial trajectory planning for aggressive quadrotor flight in dense indoor environments,","venue":null,"work_id":"1dddd03f-ce9e-436a-b927-1c0b349bad64","year":2016},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.659519Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:22ca892c6f8ce690ad60919e695ae9a5c5f02ca3fbc078e53a3dbe8f24de62e4","observation_id":"2b095581-f398-489b-8d76-756a233693c6","resolution":{"observed_at":"2026-08-14T11:47:45.004223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:44.985875Z","title":"Generation of collision-free trajectories for a quadrocopter fleet: A sequential convex programming approach,","venue":null,"work_id":"3bcf791e-21b3-4b8b-b771-f15a3d26c170","year":2012},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.663813Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:f6410bf9fbab2c160f5208b2f1a87160eb88a4f418366008db4d9680c022e5b4","observation_id":"3670fd05-dcd2-4df8-9de6-b23bf3ebf1da","resolution":{"observed_at":"2026-08-14T11:47:44.990432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:44.972419Z","title":"Decoupled multiagent path planning via incremental sequential convex programming,","venue":null,"work_id":"e4f75cbb-0753-430f-8d40-fcced2d37e07","year":2015},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.668473Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:2a0b4c3ed12303280199af0151ee7d151d2d727258c12effdcbd66e07d520616","observation_id":"4e2a7c3a-ae55-4bfc-aff6-e18f9fb68ee6","resolution":{"observed_at":"2026-08-14T11:47:44.976879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:44.958154Z","title":"Motion planning with sequential convex optimization and convex collision checking,","venue":null,"work_id":"e4f209ce-c560-46bf-af5e-1eb0b9079348","year":2014},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.672731Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:ae76e6dfe59ac8d6f299b8c22a3e4cec0f57c370b3005c106f735e304ed69a4d","observation_id":"9b70c2b3-3a46-4bad-9767-46465cc7aa10","resolution":{"observed_at":"2026-08-14T11:47:44.962974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:44.943148Z","title":"Online generation of collision-free trajectories for quadrotor flight in unknown cluttered environments,","venue":null,"work_id":"2a3db73e-b1f4-4131-bd18-b1f132ecff73","year":2016},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.676886Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:f82093e7d92f786d7caddc24415ad35c480dc595be28e59bb1fdc954d34adf18","observation_id":"54a84661-c959-4975-8caf-a9e39494c6d5","resolution":{"observed_at":"2026-08-14T11:47:44.947823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:44.929309Z","title":"CHOMP: Covariant hamiltonian optimization for motion planning,","venue":null,"work_id":"0fd21b86-4d9c-44ce-83da-0cfff211473f","year":2013},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.681380Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:4a54ce5a8ecfd8f1f57dc21f3ea88efb2b66ed3d810baa1594c9c0b0f8a081fa","observation_id":"fc4d06e8-5cf9-468f-9517-05b66e8e812c","resolution":{"observed_at":"2026-08-14T11:47:44.933861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:44.914624Z","title":"STOMP: Stochastic trajectory optimization for motion planning,","venue":null,"work_id":"5d3c261e-f8a7-431a-a996-2d17a461b3eb","year":2011},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.686595Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:4c41a255641c0ae3b5f19d548eba706634e74b555c5e6607451c05a8394f9ca8","observation_id":"d25f2154-73d1-4fe6-af2a-03619e515fa7","resolution":{"observed_at":"2026-08-14T11:47:44.919303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:44.899920Z","title":"Continuous-time trajectory optimization for online UA V replan- ning,","venue":null,"work_id":"b6149a38-8441-405c-9e4e-635118522cf5","year":2016},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.691157Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:e892fae979e8784b566b84dcf3fc592cf6f2ae5c0b36e9d361ca9e9db2bfd069","observation_id":"e023b6af-e4f1-4bfd-b4af-ad315c648e3c","resolution":{"observed_at":"2026-08-14T11:47:44.904649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:44.885540Z","title":"Estimation, control, and planning for aggressive flight with a small quadrotor with a single camera and IMU,","venue":null,"work_id":"dd2ffd6b-0045-422a-8c00-76d3e3cfdb5a","year":2017},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.695925Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:2a0b1d8904782f4de741aea4fd8905f4b18e7f743a5ecd4b548acbe76b0feb59","observation_id":"d520e6e3-1e20-4404-bf17-bb6cc055e0a9","resolution":{"observed_at":"2026-08-14T11:47:44.890260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:44.870697Z","title":"Sampling-based path planning on configuration-space costmaps,","venue":null,"work_id":"84e9882f-36a4-4b86-9389-d1cdfe543e38","year":2010},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.700405Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:976db6961d9d4ba7f3351d9ef94cdf3da88b3461ee431cdc4185c2c3caf9355d","observation_id":"6c243e30-b531-4138-9183-058abdf67ed1","resolution":{"observed_at":"2026-08-14T11:47:44.875579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:44.856801Z","title":"Optimal path planning in complex cost spaces with sampling-based algorithms,","venue":null,"work_id":"e96e2695-0c45-4fc6-84a0-5732caa7bb5c","year":2016},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.705314Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:1f352b43e0a64269e43a5606acd15ae9ee9bc2ae25300b1fd58ad6282adfc21e","observation_id":"27b39e63-5342-4f68-bf13-5d339028f4f7","resolution":{"observed_at":"2026-08-14T11:47:44.861330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:44.840964Z","title":"Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic,","venue":null,"work_id":"1a719dd5-9403-4d87-b188-10ad01c94db4","year":2014},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.709424Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:833a02726bc8f17ecae12790993930dee492c781cf9fe02686f0b8fef43455bf","observation_id":"01643aa7-c015-427d-aece-f3ee62707ae6","resolution":{"observed_at":"2026-08-14T11:47:44.846537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:44.825483Z","title":"Anytime motion planning using the RRT*,","venue":null,"work_id":"e81722b1-65fb-498e-a57a-f92a05627b2e","year":2011},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.713859Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:1a7175ec8c7ce55149f8d202b62dd6a7715222f8a637bab3fa9d0799c93041a2","observation_id":"21106a02-18f5-4518-b652-f8b2191abf6d","resolution":{"observed_at":"2026-08-14T11:47:44.830072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:44.810205Z","title":"Neunert, C","venue":null,"work_id":"7ca3f7e1-2096-41c7-bab9-a2a5c5f5a8ac","year":2016},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.718536Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:c0741c5d7fc4e14e4dd755b565333239ba2279512b90f03a356e0decad53e275","observation_id":"e1638328-642c-4b42-a8cd-e1681ef2ed0a","resolution":{"observed_at":"2026-08-14T11:47:44.815477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:44.794386Z","title":"[Online]","venue":null,"work_id":"77c2a9db-72c5-4c89-b2a0-770537a9696c","year":2016},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.723390Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:b65fac265a0cc8dbc6c576edb1d270249f03bf79f1c1de477b7ceb872aa86271","observation_id":"1c1c4b99-75ec-4f4e-94ce-cf56277ec1c6","resolution":{"observed_at":"2026-08-14T11:47:44.799378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:44.778694Z","title":"High-speed flight in an ergodic forest,","venue":null,"work_id":"6fdb96f2-148e-49d8-9e78-c8333504b744","year":2012},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.728273Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:4bd2b8e4665e64dd21779367e17578ac196934ff9bf1aa8f881b3da861e3da79","observation_id":"8ad575bb-9e80-461f-84e5-1f1519ee30c0","resolution":{"observed_at":"2026-08-14T11:47:44.784355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:47:44.762880Z","title":"[Online]","venue":null,"work_id":"ec2d6b30-f236-4078-814a-cafbad915990","year":2016},"citing_paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T11:47:44.733071Z"},"links":{"citing_paper":"/paper/1908.08493"},"observation_digest":"sha256:3e03677d9012ab26e3a32d93730d55f99036f6d3c42c56b3be87304f6754d044","observation_id":"5b23df1e-135d-4907-a780-16b9654606bc","resolution":{"observed_at":"2026-08-14T11:47:44.768410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.08493","last_updated":"2019-08-22T16:58:06Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-16T10:45:11.184800Z","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":27},"total_outbound_references":27},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:1908.08493."}