Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- [ INFO] [1508147883.599950333]: arm[BITstarConfigDefault]: Searching for a solution to the given planning problem.
- [ INFO] [1508147883.600033380]: arm[BITstarConfigDefault]: Searching for a solution to the given planning problem.
- [ INFO] [1508147883.600748131]: arm[BITstarConfigDefault] (1 iters): Found a solution of cost 8.0890 (2 vertices) from 0 samples by processing 1 edges (1 collision checked) to create 2 vertices and perform 0 rewirings. The graph currently has 2 vertices.
- [ INFO] [1508147883.600810017]: arm[BITstarConfigDefault] (1 iters): Found a solution of cost 8.0890 (2 vertices) from 0 samples by processing 1 edges (1 collision checked) to create 2 vertices and perform 0 rewirings. The graph currently has 2 vertices.
- [ INFO] [1508147883.600857994]: arm[BITstarConfigDefault]: Finished with a solution of cost 8.0890 (2 vertices) found from 0 samples by processing 1 edges (1 collision checked) to create 2 vertices and perform 0 rewirings. The final graph has 2 vertices.
- [ INFO] [1508147883.600905827]: arm[BITstarConfigDefault]: Finished with a solution of cost 8.0890 (2 vertices) found from 0 samples by processing 1 edges (1 collision checked) to create 2 vertices and perform 0 rewirings. The final graph has 2 vertices.
- [ INFO] [1508147883.601301531]: ParallelPlan::solve(): Solution found by one or more threads in 0.001402 seconds
- [ INFO] [1508147883.601590502]: SimpleSetup: Path simplification took 0.000031 seconds and changed from 2 to 2 states
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
