|  Alex Cunningham | 0b333630e7 | Added an SQPOptimizer class with accompanying test - currently doesn't do much | 2009-11-23 19:57:35 +00:00 | 
				
					
						|  Viorela Ila | d15a7a073c | SymbolicFactor works in Matlab | 2009-11-23 19:45:09 +00:00 | 
				
					
						|  Alex Cunningham | 36877532ad | Added ground truth for VSLAM example in testSQP | 2009-11-23 16:45:53 +00:00 | 
				
					
						|  Frank Dellaert | f272e2f6fe | Added a second smoother test | 2009-11-23 05:27:37 +00:00 | 
				
					
						|  Frank Dellaert | 9bac438dbe | Play nice with BOOST_FOREACH: non-const begin/end. Also removed buggy clear(). | 2009-11-23 05:27:19 +00:00 | 
				
					
						|  Michael Kaess | 10a8ac34ec | iSAM smoother test | 2009-11-23 01:16:58 +00:00 | 
				
					
						|  Frank Dellaert | 4951a25453 | More efficient removeTop | 2009-11-23 00:02:06 +00:00 | 
				
					
						|  Frank Dellaert | 35af122e83 | Added a new version of removeTop and simplified update | 2009-11-22 23:50:01 +00:00 | 
				
					
						|  Michael Kaess | 7d384488e3 | BayesTree::update generalized and moved from testIncremental to BayesTree; testIncremental removed | 2009-11-22 23:35:13 +00:00 | 
				
					
						|  Frank Dellaert | 64a43b0492 | removeTop now does not bomb when a clique does not exist: it just does nothing | 2009-11-22 22:59:56 +00:00 | 
				
					
						|  Frank Dellaert | 4e74edba72 | Some simplification | 2009-11-22 22:39:32 +00:00 | 
				
					
						|  Michael Kaess | ab117947d7 | update now takes a factor graph, rather than an individual factor | 2009-11-22 22:26:24 +00:00 | 
				
					
						|  Michael Kaess | a3de1df5a4 | adding orphans assuming that the first separator key refers to the parent; GTSAM_PRINT define | 2009-11-22 21:18:31 +00:00 | 
				
					
						|  Frank Dellaert | 198f73a05f | Insert conditionals straight into the topless bayesTree | 2009-11-22 18:40:55 +00:00 | 
				
					
						|  Frank Dellaert | 32db0595f4 | using removeTop now | 2009-11-22 18:27:14 +00:00 | 
				
					
						|  Frank Dellaert | 952798e751 | fixed orphans bug | 2009-11-22 18:22:17 +00:00 | 
				
					
						|  Frank Dellaert | 9da2f16f4d | Removed copy/paste in unit tests | 2009-11-22 18:12:29 +00:00 | 
				
					
						|  Frank Dellaert | d4aaa5d114 | Added two more removePath tests and fixed bug in removeTop. But orphan list is still incorrect. | 2009-11-22 18:06:28 +00:00 | 
				
					
						|  Michael Kaess | 45292f7bd6 | Cliques implemented; unit test on orphans for removePath; bug fix in removePath/orphans | 2009-11-22 17:40:24 +00:00 | 
				
					
						|  Frank Dellaert | 53754ccbb8 | removeTop with one factor implemented and one test works (orphans not yet checked) | 2009-11-22 17:34:59 +00:00 | 
				
					
						|  Frank Dellaert | 6f11c0803b | Cliques class | 2009-11-22 16:46:29 +00:00 | 
				
					
						|  Frank Dellaert | 7ce62f1626 | Some template magic and boost:tie cleared up the compile issues in removePath | 2009-11-22 16:04:51 +00:00 | 
				
					
						|  Michael Kaess | 4449cfd30c | remove_path now also returns list of orphaned subtree roots; compile problem... | 2009-11-21 23:41:43 +00:00 | 
				
					
						|  Frank Dellaert | 82aae3c161 | Some re-factoring (using BOOST_FOREACH to loop over string list), root is now NULL after removing root clique | 2009-11-21 21:48:10 +00:00 | 
				
					
						|  Alex Cunningham | 1fd0404ec9 | Cleanup in testSQP, also demoed the unary constraint, as well. | 2009-11-21 19:05:24 +00:00 | 
				
					
						|  Frank Dellaert | 00b5b25591 | Awesome recursive version of removePath | 2009-11-21 06:14:53 +00:00 | 
				
					
						|  Frank Dellaert | 072846a70f | moved addClique and removeClique implementations to inl.h, removePath takes clique argument now | 2009-11-21 06:07:46 +00:00 | 
				
					
						|  Frank Dellaert | 286d826119 | removed print | 2009-11-21 06:06:30 +00:00 | 
				
					
						|  Frank Dellaert | b113194e58 | While watching TV :-) added some constructors for more readable tests. | 2009-11-21 04:59:50 +00:00 | 
				
					
						|  Frank Dellaert | a0a250750b | compare config | 2009-11-21 04:22:59 +00:00 | 
				
					
						|  Michael Kaess | 0286bc27eb | removePath mostly working | 2009-11-21 03:38:13 +00:00 | 
				
					
						|  Alex Cunningham | 08f5b074a0 | Added verbosity selector for the SQP demo to remove printouts every time it runs | 2009-11-20 14:29:11 +00:00 | 
				
					
						|  Frank Dellaert | 715dc4474d | functional STL magic | 2009-11-20 14:18:26 +00:00 | 
				
					
						|  Frank Dellaert | d234365d53 | involves is const | 2009-11-20 14:17:52 +00:00 | 
				
					
						|  Alex Cunningham | 5f848f272b | SQP demo that moves maps into the correct reference frames is now working using the NonlinearConstraint machinery. | 2009-11-20 14:05:21 +00:00 | 
				
					
						|  Frank Dellaert | e440767db9 | Use [involves], and now updating orphan list | 2009-11-20 05:23:47 +00:00 | 
				
					
						|  Frank Dellaert | 55e85fd8a5 | [involves] checks whether variable with that key is involved in any factor | 2009-11-20 05:14:34 +00:00 | 
				
					
						|  Alex Cunningham | 6aba2f1c1c | Changed initial SQP example to use exmap using the new scaling function for VectorConfig | 2009-11-20 05:13:32 +00:00 | 
				
					
						|  Alex Cunningham | acfe742c29 | Added a simple scaling function for VectorConfigs | 2009-11-20 05:10:55 +00:00 | 
				
					
						|  Alex Cunningham | 714edb57f0 | Basic implementation of a binary nonlinear constraint, with working linearization of a binary constraint. | 2009-11-20 03:50:48 +00:00 | 
				
					
						|  Alex Cunningham | ee4a066275 | Implemented linearization and equality for unary NonlinearConstraints.  Current tests use a scalar example.  Split out implementation into a separate implementation file. | 2009-11-20 03:04:49 +00:00 | 
				
					
						|  Michael Kaess | 4ca1dbf325 | generalized most of the update algorithm | 2009-11-19 23:25:03 +00:00 | 
				
					
						|  Alex Cunningham | 429f27550c | Added a NonlinearConstraint and testNonlinearConstraint.  There is currently an abstract base class for constraints and a partially implemented unary constraint. | 2009-11-19 16:50:18 +00:00 | 
				
					
						|  Frank Dellaert | cd913566f2 | I now use push_back to add factors to the new factor graph, and called getOrdering to compute a colamd order. I fixed the test so it checks the right order. Unfortunately colamd is a worse ordering, and the two cliques from before are merged into one. | 2009-11-19 06:37:06 +00:00 | 
				
					
						|  Frank Dellaert | 8d8503bd99 | constructor with three parents | 2009-11-19 06:34:28 +00:00 | 
				
					
						|  Frank Dellaert | b2eee54b5a | push_back an entire factor graph | 2009-11-19 06:34:07 +00:00 | 
				
					
						|  Frank Dellaert | e2a3d1cb8f | Fixed test | 2009-11-19 04:52:46 +00:00 | 
				
					
						|  Alex Cunningham | f98f49381a | Added an example to testSQP to use for combining graphs | 2009-11-18 21:57:59 +00:00 | 
				
					
						|  Alex Cunningham | d700cd2cac | Made some small changes to testSQP to simplify the system and improve convergence. | 2009-11-18 20:23:07 +00:00 | 
				
					
						|  Alex Cunningham | 7fc68e2d90 | Updated testSQP to use a real SQP implementation as separate factors on the previous problem.  SQP now works. | 2009-11-18 19:42:14 +00:00 |